PHIL012 Class Notes 1/15/2001. Outline Announcements, web page Review Homework Problems (1-7) Set Theory Review & Problem 8 (if time) Assignment for Wednesday.

Slides:



Advertisements
Similar presentations
The Logic of Quantified Statements
Advertisements

Chapter 1: The Foundations: Logic and Proofs 1.1 Propositional Logic 1.2 Propositional Equivalences 1.3 Predicates and Quantifiers 1.4 Nested Quantifiers.
Basic Structures: Sets, Functions, Sequences, Sums, and Matrices
Basic Structures: Sets, Functions, Sequences, Sums, and Matrices
L41 Lecture 2: Predicates and Quantifiers.. L42 Agenda Predicates and Quantifiers –Existential Quantifier  –Universal Quantifier 
Notes on Logic Continued
Computability and Complexity 8-1 Computability and Complexity Andrei Bulatov Logic Reminder.
Syllabus Every Week: 2 Hourly Exams +Final - as noted on Syllabus
Copyright © Cengage Learning. All rights reserved.
Discrete Structures Chapter 3: The Logic of Quantified Statements
1.2 – Open Sentences and Graphs
MTH 232 Section 8.1 Algebraic Expressions, Functions, & Equations.
Satisfiability & Logical Truth PHIL /16/2001.
Predicates and Quantifiers
Conjunctions, Disjunctions, and Negations Symbolic Logic 2/12/2001.
22 March 2009Instructor: Tasneem Darwish1 University of Palestine Faculty of Applied Engineering and Urban Planning Software Engineering Department Formal.
Intro to Discrete Structures
Discrete Mathematics and Its Applications
CS1502 Formal Methods in Computer Science Lecture Notes 1 Course Information Introduction to Logic Part 1.
Day Problems Name the set(s) of numbers to which each number belongs
Math 3121 Abstract Algebra I Section 0: Sets. The axiomatic approach to Mathematics The notion of definition - from the text: "It is impossible to define.
First Order Logic Chapter 7. PL is a Weak Representational Language §Propositional Logic (PL) is not a very expressive language because: §Hard to identify.
PHIL012 Class Notes 1/12/2001. Outline Announcements, web page Names and Predicates Sentences, claims, and truth value Atomic sentences Homework Problems.
Atomic Sentences Chapter 1 Language, Proof and Logic.
The Recursion Theorem Pages 217– ADVANCED TOPICS IN C O M P U T A B I L I T Y THEORY.
Homework Review notes Complete Worksheet #1. Homework Let A = {a,b,c,d}, B = {a,b,c,d,e}, C = {a,d}, D = {b, c} Describe any subset relationships. 1.
Chapter 1, Part II: Predicate Logic With Question/Answer Animations.
CSCI 2670 Introduction to Theory of Computing Instructor: Shelby Funk.
CMPF144 FUNDAMENTALS OF COMPUTING THEORY Module 5: Classical Logic.
Logic Disjunction A disjunction is a compound statement formed by combining two simple sentences using the word “OR”. A disjunction is true when at.
Function Symbols & Arithmetic PHIL012 January 22, 2001.
Sets and Sentences Open Sentences Foundations of Real Analysis.
2.8 Methods of Proof PHIL 012 1/26/2001.
Key Concepts Representation Inference Semantics Discourse Pragmatics Computation.
CompSci 102 Discrete Math for Computer Science
Section 2.1. Section Summary Definition of sets Describing Sets Roster Method Set-Builder Notation Some Important Sets in Mathematics Empty Set and Universal.
Definition Applications Examples
Naïve Set Theory. Basic Definitions Naïve set theory is the non-axiomatic treatment of set theory. In the axiomatic treatment, which we will only allude.
Pamela Leutwyler. definition a set is a collection of things – a set of dishes a set of clothing a set of chess pieces.
COMP 170 L2 Part 3 of Course Chapter 3 of Textbook.
CS 285- Discrete Mathematics Lecture 4. Section 1.3 Predicate logic Predicate logic is an extension of propositional logic that permits concisely reasoning.
Chapter 2 With Question/Answer Animations. Section 2.1.
1 Chapter Two Basic Concepts of Set Theory –Symbols and Terminology –Venn Diagrams and Subsets.
Thinking Mathematically Statements, Negations, and Quantified Statements.
Slide 7- 1 Copyright © 2012 Pearson Education, Inc.
August 23, 2005 CSCI 2670 Introduction to Theory of Computing August 23, 2005.
CSE 311: Foundations of Computing Fall 2013 Lecture 8: Proofs and Set theory.
ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.
Propositional Logic Rather than jumping right into FOL, we begin with propositional logic A logic involves: §Language (with a syntax) §Semantics §Proof.
Week 4 - Friday.  What did we talk about last time?  Floor and ceiling  Proof by contradiction.
Logics for Data and Knowledge Representation ClassL (part 1): syntax and semantics.
Section 1.5 and 1.6 Predicates and Quantifiers. Vocabulary Predicate Domain Universal Quantifier Existential Quantifier Counterexample Free variable Bound.
Lecture 041 Predicate Calculus Learning outcomes Students are able to: 1. Evaluate predicate 2. Translate predicate into human language and vice versa.
Section 1.4. Propositional Functions Propositional functions become propositions (and have truth values) when their variables are each replaced by a value.
Discrete Mathematical Structures: Theory and Applications 1 Logic: Learning Objectives  Learn about statements (propositions)  Learn how to use logical.
Propositional Logic. Assignment Write any five rules each from two games which you like by using propositional logic notations.
Logics for Data and Knowledge Representation ClassL (part 1): syntax and semantics.
Chapter 2 1. Chapter Summary Sets (This Slide) The Language of Sets - Sec 2.1 – Lecture 8 Set Operations and Set Identities - Sec 2.2 – Lecture 9 Functions.
PHIL 012 2/14/2001 Logical Equivalence & Translation.
Sets Page 746.
3. The Logic of Quantified Statements Summary
Logic II CSE 140 etc..
Lecture 1 – Formal Logic.
How do you compare and use the properties of real numbers?
Conditionals and Biconditionals
Discrete Mathematics Lecture 4 & 5: Predicate and Quantifier
Discrete Mathematics Lecture 3: Predicate and Quantifier
Discrete Mathematics CMP-200 Propositional Equivalences, Predicates & Quantifiers, Negating Quantified Statements Abdul Hameed
Discrete Mathematics Lecture 4 & 5: Predicate and Quantifier
Representations & Reasoning Systems (RRS) (2.2)
Presentation transcript:

PHIL012 Class Notes 1/15/2001

Outline Announcements, web page Review Homework Problems (1-7) Set Theory Review & Problem 8 (if time) Assignment for Wednesday (1/17)

Announcements Notes are online. Syllabus has been updated. URL for web page: Note the URL’s are CASE SENSITIVE.

Last Time Atomic sentences make claims that have truth value. In other words, they are TRUE or FALSE. An atomic sentence consists of a predicate followed by a list of names, the number of which correspond to the predicate’s arity. Names refer to objects. Predicates refer to properties or relations of objects.

Homework Problems 1-7

2.4 The Language of Set Theory Set Theory  First Order Logic (FOL) Set Theory is a formal language of mathematics, used to describe counting. Set Theory, unlike FOL, has only two symbols: –=, meaning “is the same number or set” – , meaning “is a member of”

The Domain of Set Theory In set theory, the domain of objects is the set of numbers, usually the whole numbers: - , …, -1, 0, 1, …,  In set theory, names can also (sometimes) refer to sets of numbers. A set is simply a collection of numbers, of other sets, or of a mix of numbers and sets.

Examples of Set Theory Sentences Good: a = { 1 } Good: b = { 2, 3, 4 } Good: c = { 1, 2, 3, 4 } which is the same as: c = { a, b } and also the same as c = { 1, b } and c = { a, 2, 3, 4 } and c = { 1, { 2, 3, 4 }} Bad: Cube(c)

The Identity Symbol “= ” “= ” means the same thing in both FOL and Set Theory. “a=b” means that “a” and “b” are names that refer to the same objects, which can denote numbers or sets. “a=b” also means that whatever claims are made of a must also be true of b (and vice versa) if “a=b” is true.

The Identity Symbol “= ” So, if “a = { 2 }” is true and if “a = b” is true, we know that “b = { 2 }” is true also.

The Membership Symbol “  ” The Membership symbol means “is a member of” “a  b” means that “a is a member of b” This means that if “a” and “b” are sets, all of the members of “a” appear at least once in “b” “b” may or may not have additional members, besides those in “a”

The Membership Symbol “  ” So, assuming: a = { 6, 10 } b = { 2, 4, 6, 10 } c = { 10, 12 } c  b b  a a  b false true

Truth Value & Reference in Set Theory In Set Theory, once the reference of a name is fixed, the truth value of all sentences containing that name is fixed once and for all. If a= {1} and b = { 1, 2 }, all statements about a and b will always The only way the truth value of these statements could change would be to change the reference of a or b.

Truth Value & Reference in FOL This is NOT the case in FOL. Suppose the name “Phillip” refers to me and the predicate “Indoors” means “is indoors”. Without changing the reference of “Phillip” the truth of the sentence “Indoors(Phillip)” will change the moment I go outside.

Homework Problem 8

Assignment for Wednesday (1/17) Read 2.5 and 2.6 if you haven’t already Work problems The homework system should be set up by Wednesday so we’ll spend some time talking about it.