Identity. We often use the word identical to simply mean looks the same. For instance:

Size: px
Start display at page:

Download "Identity. We often use the word identical to simply mean looks the same. For instance:"

Transcription

1 Identity 1. Introduction: In this lesson, we are going to learn how to express statements about identity; or, namely, we re going to learn how to say that two things are identical. We often use the word identical to simply mean looks the same. For instance: Ashley and Mary Kate are identical twins. Your iphone is identical to mine. The look on your two faces is identical right now. That s not how WE are going to use the term identical. In philosophy, identical means is one and the same object. For instance: Mark Twain is identical to Samuel Clemens. The capitol city of Virginia is identical to Richmond. The inventor of the bifocals is identical to Benjamin Franklin. Here, when we say identical, we mean, e.g., that Mark Twain is one and the same individual as Samuel Clemens. To differentiate these two uses, philosophers often say that Ashley and Mary Kate (two twins) are QUALITATIVELY identical, while Mark Twain and Samuel Clemens are NUMERICALLY identical. We re going to use a new symbol to express numerical identity, the equals sign =. Note that = is NOT an operator; rather it is a predicate. For, while we will express x is identical to y as x=y, we might just as easily have chosen I to express the predicate is identical to and have written Ixy instead. But, the predicate is so common that logicians decided to give it its own symbol. Here are some translations using this new symbol: (1) x is identical to y x=y (2) x is not identical to y (x=y) alternatively: x y 2. Except Statements: Identity is especially useful in translating except statements. Here are some examples: (3) Everyone except Dave was at the show. Sa (ꓯx)(x d Sx) Literally: Dave was not at the show, and, for all x, if that x is a person who is not Dave, then they were at the show. Note: Of course we don t usually mean that EVERYONE except Dave was at the show. That means over 7 billion people attended! But, typically, in conversation it is assumed that our 1

2 statement refers to a restricted domain. So, in this class it will be permissible to assume that the domain of the ꓯ is restricted to the relevant objects whenever it is implied by the context of the statement. Notice that I wrote Sa at the front of the wff. If I had only written (ꓯx)(x d Sx) then this could be true EVEN IF DAVE WAS ALSO AT THE SHOW. But, when we make except statements, we mean to EXCLUDE the exception. For instance, if I dismissed class by saying, Everyone except Alex may go, it would be quite cheeky of Alex to get up and leave as well, claiming that Everyone except Alex may go does not entail that Alex may NOT go. Of course it does. So, in this class, we will translate except phrases as conjunctions, where one of the conjuncts EXCLUDES the exception. NOTE THAT THIS IS IN DISAGREEMENT WITH YOUR TEXTBOOK (though it is in agreement with most other textbooks). By the way, Everyone except Alex may go gets translated: Ga (ꓯx)(x a Gx) Note: This goes for other than and but phrases as well. For instance, Everyone other than Alex may go and Everyone but Alex may go both get translated in the same way as the except statement above. Let s do another: (4) If every athlete except Betty was disqualified, then Betty won. (ꓯx){[(Ax x b) Dx] Db} Wb Literally: If all of the x s who are athletes and aren t Betty were disqualified AND if Betty herself wasn t also disqualified then Betty won. (Note also that the entire antecedent of this conditional is an except statement.) 3. Only Statements: Only statements are like inside-out except statements. For instance, if I said, Only Edward slept, it means the same thing as Everyone except Edward FAILED to sleep. (5) Only Edward slept. Se (ꓯx)(Sx x=e) (6) Everyone except Edward failed to sleep. Se (ꓯx)(x e Sx) As it turns out, (5) and (6) are logically equivalent. This should look vaguely familiar. Remember contraposition (contra.)? P Q Q P (S65) 2

3 Let s do another: (7) The only character who could open the golden snitch was Harry. [C, O, h] (Ch Oh) (ꓯx)[(Cx Ox) x=h] Literally: Harry was a character and Harry could open the golden snitch, AND, for all x, if x was a character who could open the snitch, then that x was Harry. 4. Superlative Adjectives: These are adjectives with most or -est. Translated as: (8) Jupiter is the largest planet. Pj (ꓯx)[(Px x j) Ljx] Translate Lxy as x is larger than y. Literally, the symbolized statement reads: Jupiter is a planet, and, for all x, if x is a planet that is not Jupiter, then Jupiter is larger than it. 5. Numerical Statements: Many statements refer to numbers. Let s translate some: (9) There is at least one president. (ꓱx)Px (10) There is at most one president. (ꓯx)(ꓯy)[(Px Py) x=y] Literally: For all x, and for all y, if x is president and y is president, then x is y. (11) There is exactly one president. (ꓱx)[Px (ꓯy)(Py y=x) Literally: There exists an x that is president, and for all y, if y is president, then y is x. (12) There are at least two bedrooms. (ꓱx)(ꓱy)[(Bx By) x y] Literally: There exists at least one x that is a bedroom and at least one y that is a bedroom, and x is not the same thing as y. (13) There are at most two bedrooms. (ꓯx)(ꓯy)(ꓯz){[(Bx By) Bz] [(x=y x=z) y=z]} Literally: For all x, y, and z, if x, y, and z are all bedrooms, then either x and y are the same bedroom, or x and z are, or y and z are (i.e., two of the 3 are really just 1 thing). (14) There are exactly two bedrooms. (ꓱx)(ꓱy){[(Bx By) x y] (ꓯz)[Bz (z=x z=y)]} Literally: There exists at least one x and one y that are bedrooms, and x is not y, AND, for all z, if z is a bedroom them z is either the same bedroom as x, or the same one as y. 3

4 Derivation Rules for Identity As with the operators that we ve learned, the identity predicate also has both an elimination (=E) and an introduction (=I) rule. 1. Identity Elimination (=E): The following inference is intuitively true: Superman can fly. Superman is Clark Kent. Therefore, Clark Kent can fly. We can write this as the following sequent: S217: Fs, s=c Ⱶ Fc (note that your textbook uses different letters) Basically, =E allows us to replace one proper name with another whenever we know that two proper names refer to the same individual. So, here is the derivation: 1 (1) Fs A 2 (2) s=c A 1, 2 (3) Fc 1, 2, =E Here is an instance of using =E for multi-place predicates: The Joker attacked Superman. Superman is Clark Kent. Therefore, the Joker attacked Clark Kent. Here s the sequent: S218: Ajs, s=c Ⱶ Ajc (again, your textbook uses different letters) 1 (1) Ajs A 2 (2) s=c A 1, 2 (3) Ajc 1, 2, =E Since we know from (2) that s=c, =E allows us to take any wff where s appears and rewrite that wff with c replacing s. The new line rests on the original wff as well as the line which tells us that s=c. Note #1: Note that you are NOT required to replace every occurrence of the proper name with its new name. For example, the following inference is valid: Superman can fly, and the Joker attacked Superman. Superman is Clark Kent. Therefore, Clark Kent can fly, and the Joker attacked Superman. S219: Fs Ajs, s=c Ⱶ Fc Ajs (again, I used different letters than the textbook) 4

5 1 (1) Fs Ajs A 2 (2) s=c A 1, 2 (3) Fc Ajs 1, 2, =E Notice that only the first s was replaced with a c above. Replacing both is not required. Note #2: Note that sometimes you will use =E to replace a variable with another variable. There is a restriction on this: (a) The original variable must be free AND (b) It must STILL be free after it has been replaced. For instance, the following is NOT acceptable: 1 (1) (ꓱy)Bxy A 2 (2) x=y A 1, 2 (3) (ꓱy)Byy 1, 2, =E NO! Here, we attempted to replace x in line (1) with y. Criterion (a) IS met: x is free in the original formula in line (1). So far, so good. However, criterion (b) is NOT met: y is NOT free in (1), so the variable BECOMES bound in line (3) once we make the replacement. This is NOT permitted. [Clearly it does not follow from some x betrays someone in (1) that someone betrays him/herself in line (3).] 2. Identity Introduction (=I): The following are tautologies: Mark Twain is Mark Twain. Superman is Superman. Benjamin Franklin is Benjamin Franklin. Remember that a tautology is a statement that cannot possibly be false. As such it is a logical truth, which you are permitted to introduce at any point in a derivation. Like this: 1 (1) blah blah A 2 (2) blah blah A - (3) a=a =I Notice that line (3) rests on no other statements it s a tautology! and also that, to the right, it involves no other lines; only identity-introduction. We can use =I in the following ways: a=b Ⱶ b=a 1 (1) a=b A - (2) a=a =I 1 (3) b=a 1, 2, =E 5

6 Note that just plain swapping a and b is not permitted in one line. b=a IS entailed by a=b but it s not a primitive rule that we can just swap their places. Here s another easy sequent: a=a (b=b Sc) Ⱶ Sc 1 (1) a=a (b=b Sc) A - (2) a=a =I 1 (3) b=b Sc 1, 2, E - (4) b=b =I 1 (5) Sc 3, 4, E 3. Practice Derivations: So, when would we use =E or =I? Let s do some examples. All authors are literate. Mark Twain is an author. Samuel Clemens is Mark Twain. Therefore, Samuel Clemens is literate. (ꓯx)(Ax Lx), Am, s=m Ⱶ Ls 1 (1) (ꓯx)(Ax Lx) A 2 (2) Am A 3 (3) s=m A??? 1, 2, 3 (n) Ls? What to do? Well, we can perform ꓯE on line (1), and since we know that m is in the domain, we can replace the x variables with m proper names: 1 (1) (ꓯx)(Ax Lx) A 2 (2) Am A 3 (3) s=m A 1 (4) Am Lm 1, ꓯE 1, 2 (5) Lm 2, 4, E - (6) s=s =I 3 (7) m=s 3, 6 1, 2, 3 (8) Ls 5, 7, =E Note: Why didn t we just go straight from (5) to (8)? Well, technically, the rules only permit you to replace m with s if there is a statement m=s where the original name is the FIRST name, and the new name is the SECOND name in the identity statement. But, since 6

7 we now know that a=b entails b=a, let s forget this technicality from now on. We can treat it as a sequent introduction variant of =E; just be aware that, strictly speaking, to jump straight from (5) to (8) IS a sequent introduction and not straightforward use of =E. Another: Donald is president. Becky is not president. Therefore, Donald is not Becky. Pd, Pb Ⱶ d b 1 (1) Pd A 2 (2) Pb A??? 1, 2 (n) d b? We should approach this by assuming the opposite of the conclusion for reductio. Note that d b is really just (d=b), so the opposite of the conclusion is just d=b. 1 (1) Pd A 2 (2) Pb A 3 (3) d=b Ass. (Red.) 1, 3 (4) Pb 1, 3, =E 1, 2, 3 (5) Pb Pb 2, 4, I 1, 2 (6) d b 3, 5, I One More: The Roman general who defeated Pompey conquered Gaul. Julius Caesar is a Roman general, and he defeated Pompey. Therefore, Julius Caesar conquered Gaul. 1 (1) (ꓱx)({[(Rx Dxp) (ꓯy)[(Ry Dyp) y=x]} Cxg) A 2 (2) Rj Djp A??? 1, 2 (n) Cjg? Because the first claim is that THE Roman general who, the implication is that there is only ONE such person. That is why we added the (ꓯy)[(Ry Dyp) y=x] claim. Now, clearly we re going to have to get rid of the ꓱ in (1), so an ꓱE is in order. Let s start that, and a series of E s to dig out the universally quantified wff: 7

8 1 (1) (ꓱx)({[(Rx Dxp) (ꓯy)[(Ry Dyp) y=x]} Cxg) A 2 (2) Rj Djp A 3 (3) {[(Rx Dxp) (ꓯy)[(Ry Dyp) y=x]} Cxg Ass. (ꓱE) 3 (4) (Rx Dxp) (ꓯy)[(Ry Dyp) y=x] 3, E 3 (5) (ꓯy)[(Ry Dyp) y=x] 4, E??? 1, 2 (n) Cjg? Now we can perform ꓯE, replacing y with j since we know that j is in the domain: 1 (1) (ꓱx)({[(Rx Dxp) (ꓯy)[(Ry Dyp) y=x]} Cxg) A 2 (2) Rj Djp A 3 (3) {[(Rx Dxp) (ꓯy)[(Ry Dyp) y=x]} Cxg Ass. (ꓱE) 3 (4) (Rx Dxp) (ꓯy)[(Ry Dyp) y=x] 3, E 3 (5) (ꓯy)[(Ry Dyp) y=x] 4, E 3 (6) (Rj Djp) j=x 5, ꓯE 2, 3 (7) j=x 2, 6, E 3 (8) Cxg 3, E 2, 3 (9) Cjg 7, 8, =E 2 (10) ({[(Rx Dxp) (ꓯy)[(Ry Dyp) y=x]} Cxg) Cjg 3, 9, I 1, 2 (11) Cjg 1, 10, ꓱE We did it! 8

Single-Predicate Derivations

Single-Predicate Derivations Single-Predicate Derivations Let s do some derivations. Start with an easy one: Practice #1: Fb, Gb Ⱶ (ꓱx)(Fx Gx) Imagine that I have a frog named Bob. The above inference might go like this: Bob is friendly.

More information

Quantifiers Here is a (true) statement about real numbers: Every real number is either rational or irrational.

Quantifiers Here is a (true) statement about real numbers: Every real number is either rational or irrational. Quantifiers 1-17-2008 Here is a (true) statement about real numbers: Every real number is either rational or irrational. I could try to translate the statement as follows: Let P = x is a real number Q

More information

Logic, Sets, and Proofs

Logic, Sets, and Proofs Logic, Sets, and Proofs David A. Cox and Catherine C. McGeoch Amherst College 1 Logic Logical Operators. A logical statement is a mathematical statement that can be assigned a value either true or false.

More information

Derivations, part 2. Let s dive in to some derivations that require the use of the last four rules:

Derivations, part 2. Let s dive in to some derivations that require the use of the last four rules: Derivations, part 2 Let s dive in to some derivations that require the use of the last four rules: 1. I Derivations: Let s start with some derivations that use conditional-introduction. (a) Here s an easy

More information

Section 1.3. Let I be a set. When I is used in the following context,

Section 1.3. Let I be a set. When I is used in the following context, Section 1.3. Let I be a set. When I is used in the following context, {B i } i I, we call I the index set. The set {B i } i I is the family of sets of the form B i where i I. One could also use set builder

More information

1 Propositional Logic

1 Propositional Logic 1 Propositional Logic Required reading: Foundations of Computation. Sections 1.1 and 1.2. 1. Introduction to Logic a. Logical consequences. If you know all humans are mortal, and you know that you are

More information

cis32-ai lecture # 18 mon-3-apr-2006

cis32-ai lecture # 18 mon-3-apr-2006 cis32-ai lecture # 18 mon-3-apr-2006 today s topics: propositional logic cis32-spring2006-sklar-lec18 1 Introduction Weak (search-based) problem-solving does not scale to real problems. To succeed, problem

More information

Deduction by Daniel Bonevac. Chapter 8 Identity and Functions

Deduction by Daniel Bonevac. Chapter 8 Identity and Functions Deduction by Daniel Bonevac Chapter 8 Identity and Functions Introduction 1 This chapter introduces two important extensions of Q that make it quite a bit more powerful. The first is the mathematical relation

More information

Logical Operators. Conjunction Disjunction Negation Exclusive Or Implication Biconditional

Logical Operators. Conjunction Disjunction Negation Exclusive Or Implication Biconditional Logical Operators Conjunction Disjunction Negation Exclusive Or Implication Biconditional 1 Statement meaning p q p implies q if p, then q if p, q when p, q whenever p, q q if p q when p q whenever p p

More information

A Little Deductive Logic

A Little Deductive Logic A Little Deductive Logic In propositional or sentential deductive logic, we begin by specifying that we will use capital letters (like A, B, C, D, and so on) to stand in for sentences, and we assume that

More information

A Little Deductive Logic

A Little Deductive Logic A Little Deductive Logic In propositional or sentential deductive logic, we begin by specifying that we will use capital letters (like A, B, C, D, and so on) to stand in for sentences, and we assume that

More information

Supplementary Logic Notes CSE 321 Winter 2009

Supplementary Logic Notes CSE 321 Winter 2009 1 Propositional Logic Supplementary Logic Notes CSE 321 Winter 2009 1.1 More efficient truth table methods The method of using truth tables to prove facts about propositional formulas can be a very tedious

More information

2/2/2018. CS 103 Discrete Structures. Chapter 1. Propositional Logic. Chapter 1.1. Propositional Logic

2/2/2018. CS 103 Discrete Structures. Chapter 1. Propositional Logic. Chapter 1.1. Propositional Logic CS 103 Discrete Structures Chapter 1 Propositional Logic Chapter 1.1 Propositional Logic 1 1.1 Propositional Logic Definition: A proposition :is a declarative sentence (that is, a sentence that declares

More information

Mat 243 Exam 1 Review

Mat 243 Exam 1 Review OBJECTIVES (Review problems: on next page) 1.1 Distinguish between propositions and non-propositions. Know the truth tables (i.e., the definitions) of the logical operators,,,, and Write truth tables for

More information

Proof. Theorems. Theorems. Example. Example. Example. Part 4. The Big Bang Theory

Proof. Theorems. Theorems. Example. Example. Example. Part 4. The Big Bang Theory Proof Theorems Part 4 The Big Bang Theory Theorems A theorem is a statement we intend to prove using existing known facts (called axioms or lemmas) Used extensively in all mathematical proofs which should

More information

Notes on Propositional and First-Order Logic (CPSC 229 Class Notes, January )

Notes on Propositional and First-Order Logic (CPSC 229 Class Notes, January ) Notes on Propositional and First-Order Logic (CPSC 229 Class Notes, January 23 30 2017) John Lasseter Revised February 14, 2017 The following notes are a record of the class sessions we ve devoted to the

More information

CHAPTER 6 - THINKING ABOUT AND PRACTICING PROPOSITIONAL LOGIC

CHAPTER 6 - THINKING ABOUT AND PRACTICING PROPOSITIONAL LOGIC 1 CHAPTER 6 - THINKING ABOUT AND PRACTICING PROPOSITIONAL LOGIC Here, you ll learn: what it means for a logic system to be finished some strategies for constructing proofs Congratulations! Our system of

More information

Formal Logic: Quantifiers, Predicates, and Validity. CS 130 Discrete Structures

Formal Logic: Quantifiers, Predicates, and Validity. CS 130 Discrete Structures Formal Logic: Quantifiers, Predicates, and Validity CS 130 Discrete Structures Variables and Statements Variables: A variable is a symbol that stands for an individual in a collection or set. For example,

More information

Examples: P: it is not the case that P. P Q: P or Q P Q: P implies Q (if P then Q) Typical formula:

Examples: P: it is not the case that P. P Q: P or Q P Q: P implies Q (if P then Q) Typical formula: Logic: The Big Picture Logic is a tool for formalizing reasoning. There are lots of different logics: probabilistic logic: for reasoning about probability temporal logic: for reasoning about time (and

More information

Rosen, Discrete Mathematics and Its Applications, 6th edition Extra Examples

Rosen, Discrete Mathematics and Its Applications, 6th edition Extra Examples Rosen, Discrete Mathematics and Its Applications, 6th edition Extra Examples Section 1.4 Nested Quantifiers Page references correspond to locations of Extra Examples icons in the textbook. #1. Write the

More information

1 Predicates and Quantifiers

1 Predicates and Quantifiers 1 Predicates and Quantifiers We have seen how to represent properties of objects. For example, B(x) may represent that x is a student at Bryn Mawr College. Here B stands for is a student at Bryn Mawr College

More information

Propositional Logic: Models and Proofs

Propositional Logic: Models and Proofs Propositional Logic: Models and Proofs C. R. Ramakrishnan CSE 505 1 Syntax 2 Model Theory 3 Proof Theory and Resolution Compiled at 11:51 on 2016/11/02 Computing with Logic Propositional Logic CSE 505

More information

CS 360, Winter Morphology of Proof: An introduction to rigorous proof techniques

CS 360, Winter Morphology of Proof: An introduction to rigorous proof techniques CS 30, Winter 2011 Morphology of Proof: An introduction to rigorous proof techniques 1 Methodology of Proof An example Deep down, all theorems are of the form If A then B, though they may be expressed

More information

AI Principles, Semester 2, Week 2, Lecture 5 Propositional Logic and Predicate Logic

AI Principles, Semester 2, Week 2, Lecture 5 Propositional Logic and Predicate Logic AI Principles, Semester 2, Week 2, Lecture 5 Propositional Logic and Predicate Logic Propositional logic Logical connectives Rules for wffs Truth tables for the connectives Using Truth Tables to evaluate

More information

CS 220: Discrete Structures and their Applications. Predicate Logic Section in zybooks

CS 220: Discrete Structures and their Applications. Predicate Logic Section in zybooks CS 220: Discrete Structures and their Applications Predicate Logic Section 1.6-1.10 in zybooks From propositional to predicate logic Let s consider the statement x is an odd number Its truth value depends

More information

Discrete Mathematics and Probability Theory Spring 2014 Anant Sahai Note 1

Discrete Mathematics and Probability Theory Spring 2014 Anant Sahai Note 1 EECS 70 Discrete Mathematics and Probability Theory Spring 2014 Anant Sahai Note 1 Getting Started In order to be fluent in mathematical statements, you need to understand the basic framework of the language

More information

Logic of Sentences (Propositional Logic) is interested only in true or false statements; does not go inside.

Logic of Sentences (Propositional Logic) is interested only in true or false statements; does not go inside. You are a mathematician if 1.1 Overview you say to a car dealer, I ll take the red car or the blue one, but then you feel the need to add, but not both. --- 1. Logic and Mathematical Notation (not in the

More information

Logic and Proofs. (A brief summary)

Logic and Proofs. (A brief summary) Logic and Proofs (A brief summary) Why Study Logic: To learn to prove claims/statements rigorously To be able to judge better the soundness and consistency of (others ) arguments To gain the foundations

More information

Intermediate Logic Spring. Second-Order Logic

Intermediate Logic Spring. Second-Order Logic Intermediate Logic Spring Lecture Five Second-Order Logic Rob Trueman rob.trueman@york.ac.uk University of York 1 / 47 Introduction Second-Order Logic Introduction The Language of SOL Introduction and

More information

3/29/2017. Logic. Propositions and logical operations. Main concepts: propositions truth values propositional variables logical operations

3/29/2017. Logic. Propositions and logical operations. Main concepts: propositions truth values propositional variables logical operations Logic Propositions and logical operations Main concepts: propositions truth values propositional variables logical operations 1 Propositions and logical operations A proposition is the most basic element

More information

CS70 is a course about on Discrete Mathematics for Computer Scientists. The purpose of the course is to teach you about:

CS70 is a course about on Discrete Mathematics for Computer Scientists. The purpose of the course is to teach you about: CS 70 Discrete Mathematics for CS Fall 2006 Papadimitriou & Vazirani Lecture 1 Course Outline CS70 is a course about on Discrete Mathematics for Computer Scientists. The purpose of the course is to teach

More information

Foundation of proofs. Jim Hefferon.

Foundation of proofs. Jim Hefferon. Foundation of proofs Jim Hefferon http://joshua.smcvt.edu/proofs The need to prove In Mathematics we prove things To a person with a mathematical turn of mind, the base angles of an isoceles triangle are

More information

MAT2345 Discrete Math

MAT2345 Discrete Math Fall 2013 General Syllabus Schedule (note exam dates) Homework, Worksheets, Quizzes, and possibly Programs & Reports Academic Integrity Do Your Own Work Course Web Site: www.eiu.edu/~mathcs Course Overview

More information

! Predicates! Variables! Quantifiers. ! Universal Quantifier! Existential Quantifier. ! Negating Quantifiers. ! De Morgan s Laws for Quantifiers

! Predicates! Variables! Quantifiers. ! Universal Quantifier! Existential Quantifier. ! Negating Quantifiers. ! De Morgan s Laws for Quantifiers Sec$on Summary (K. Rosen notes for Ch. 1.4, 1.5 corrected and extended by A.Borgida)! Predicates! Variables! Quantifiers! Universal Quantifier! Existential Quantifier! Negating Quantifiers! De Morgan s

More information

Truth Table Definitions of Logical Connectives

Truth Table Definitions of Logical Connectives Truth Table Definitions of Logical Connectives 1. Truth Functions: Logicians DEFINE logical operators in terms of their relation to the truth or falsehood of the statement(s) that they are operating on.

More information

Department of Mathematics and Statistics Math B: Discrete Mathematics and Its Applications Test 1: October 19, 2006

Department of Mathematics and Statistics Math B: Discrete Mathematics and Its Applications Test 1: October 19, 2006 Department of Mathematics and Statistics Math 1019 3.0 B: Discrete Mathematics and Its Applications est 1: October 19, 2006 Name: (Last/amily) (irst) Student No. Instructions: 1. his test has 8 questions

More information

Logic. Propositional Logic: Syntax. Wffs

Logic. Propositional Logic: Syntax. Wffs Logic Propositional Logic: Syntax Logic is a tool for formalizing reasoning. There are lots of different logics: probabilistic logic: for reasoning about probability temporal logic: for reasoning about

More information

Logic and Proofs. (A brief summary)

Logic and Proofs. (A brief summary) Logic and Proofs (A brief summary) Why Study Logic: To learn to prove claims/statements rigorously To be able to judge better the soundness and consistency of (others ) arguments To gain the foundations

More information

Choosing Logical Connectives

Choosing Logical Connectives Choosing Logical Connectives 1. Too Few Connectives?: We have chosen to use only 5 logical connectives in our constructed language of logic, L1 (they are:,,,, and ). But, we might ask, are these enough?

More information

Arguments and Proofs. 1. A set of sentences (the premises) 2. A sentence (the conclusion)

Arguments and Proofs. 1. A set of sentences (the premises) 2. A sentence (the conclusion) Arguments and Proofs For the next section of this course, we will study PROOFS. A proof can be thought of as the formal representation of a process of reasoning. Proofs are comparable to arguments, since

More information

Examples. Example (1) Example (2) Let x, y be two variables, and denote statements p : x = 0 and q : y = 1. Solve. x 2 + (y 1) 2 = 0.

Examples. Example (1) Example (2) Let x, y be two variables, and denote statements p : x = 0 and q : y = 1. Solve. x 2 + (y 1) 2 = 0. Examples Let x, y be two variables, and denote statements p : x = 0 and q : y = 1. Example (1) Solve x 2 + (y 1) 2 = 0. The solution is x = 0 AND y = 1. [p q.] Example (2) Solve x(y 1) = 0. Examples Let

More information

Peano Arithmetic. by replacing the schematic letter R with a formula, then prefixing universal quantifiers to bind

Peano Arithmetic. by replacing the schematic letter R with a formula, then prefixing universal quantifiers to bind Peano Arithmetic Peano Arithmetic 1 or PA is the system we get from Robinson s Arithmetic by adding the induction axiom schema: ((R(0) v (œx)(r(x) 6 R(sx))) 6 (œx)r(x)). What this means is that any sentence

More information

Propositional Logic Not Enough

Propositional Logic Not Enough Section 1.4 Propositional Logic Not Enough If we have: All men are mortal. Socrates is a man. Does it follow that Socrates is mortal? Can t be represented in propositional logic. Need a language that talks

More information

Homework assignment 1: Solutions

Homework assignment 1: Solutions Math 240: Discrete Structures I Due 4:30pm Friday 29 September 2017. McGill University, Fall 2017 Hand in to the mailbox at Burnside 1005. Homework assignment 1: Solutions Discussing the assignment with

More information

III. Elementary Logic

III. Elementary Logic III. Elementary Logic The Language of Mathematics While we use our natural language to transmit our mathematical ideas, the language has some undesirable features which are not acceptable in mathematics.

More information

Propositional logic (revision) & semantic entailment. p. 1/34

Propositional logic (revision) & semantic entailment. p. 1/34 Propositional logic (revision) & semantic entailment p. 1/34 Reading The background reading for propositional logic is Chapter 1 of Huth/Ryan. (This will cover approximately the first three lectures.)

More information

CS 173: Discrete Mathematical Structures, Spring 2008 Homework 1 Solutions

CS 173: Discrete Mathematical Structures, Spring 2008 Homework 1 Solutions CS 173: Discrete Mathematical Structures, Spring 2008 Homework 1 Solutions 1. [10 points] Translate the following sentences into propositional logic, making the meaning of your propositional variables

More information

Introduction to Metalogic

Introduction to Metalogic Philosophy 135 Spring 2008 Tony Martin Introduction to Metalogic 1 The semantics of sentential logic. The language L of sentential logic. Symbols of L: Remarks: (i) sentence letters p 0, p 1, p 2,... (ii)

More information

Propositions and Proofs

Propositions and Proofs Propositions and Proofs Gert Smolka, Saarland University April 25, 2018 Proposition are logical statements whose truth or falsity can be established with proofs. Coq s type theory provides us with a language

More information

Reasoning. Inference. Knowledge Representation 4/6/2018. User

Reasoning. Inference. Knowledge Representation 4/6/2018. User Reasoning Robotics First-order logic Chapter 8-Russel Representation and Reasoning In order to determine appropriate actions to take, an intelligent system needs to represent information about the world

More information

Description Logics. Foundations of Propositional Logic. franconi. Enrico Franconi

Description Logics. Foundations of Propositional Logic.   franconi. Enrico Franconi (1/27) Description Logics Foundations of Propositional Logic Enrico Franconi franconi@cs.man.ac.uk http://www.cs.man.ac.uk/ franconi Department of Computer Science, University of Manchester (2/27) Knowledge

More information

Denote John by j and Smith by s, is a bachelor by predicate letter B. The statements (1) and (2) may be written as B(j) and B(s).

Denote John by j and Smith by s, is a bachelor by predicate letter B. The statements (1) and (2) may be written as B(j) and B(s). PREDICATE CALCULUS Predicates Statement function Variables Free and bound variables Quantifiers Universe of discourse Logical equivalences and implications for quantified statements Theory of inference

More information

Introduction to Predicate Logic Part 1. Professor Anita Wasilewska Lecture Notes (1)

Introduction to Predicate Logic Part 1. Professor Anita Wasilewska Lecture Notes (1) Introduction to Predicate Logic Part 1 Professor Anita Wasilewska Lecture Notes (1) Introduction Lecture Notes (1) and (2) provide an OVERVIEW of a standard intuitive formalization and introduction to

More information

Predicates, Quantifiers and Nested Quantifiers

Predicates, Quantifiers and Nested Quantifiers Predicates, Quantifiers and Nested Quantifiers Predicates Recall the example of a non-proposition in our first presentation: 2x=1. Let us call this expression P(x). P(x) is not a proposition because x

More information

2.2: Logical Equivalence: The Laws of Logic

2.2: Logical Equivalence: The Laws of Logic Example (2.7) For primitive statement p and q, construct a truth table for each of the following compound statements. a) p q b) p q Here we see that the corresponding truth tables for two statement p q

More information

Title: Logical Agents AIMA: Chapter 7 (Sections 7.4 and 7.5)

Title: Logical Agents AIMA: Chapter 7 (Sections 7.4 and 7.5) B.Y. Choueiry 1 Instructor s notes #12 Title: Logical Agents AIMA: Chapter 7 (Sections 7.4 and 7.5) Introduction to Artificial Intelligence CSCE 476-876, Fall 2018 URL: www.cse.unl.edu/ choueiry/f18-476-876

More information

LIN1032 Formal Foundations for Linguistics

LIN1032 Formal Foundations for Linguistics LIN1032 Formal Foundations for Lecture 5 Albert Gatt In this lecture We conclude our discussion of the logical connectives We begin our foray into predicate logic much more expressive than propositional

More information

EECS 1028 M: Discrete Mathematics for Engineers

EECS 1028 M: Discrete Mathematics for Engineers EECS 1028 M: Discrete Mathematics for Engineers Suprakash Datta Office: LAS 3043 Course page: http://www.eecs.yorku.ca/course/1028 Also on Moodle S. Datta (York Univ.) EECS 1028 W 18 1 / 26 Why Study Logic?

More information

Identity. "At least one dog has fleas" is translated by an existential quantifier"

Identity. At least one dog has fleas is translated by an existential quantifier Identity Quantifiers are so-called because they say how many. So far, we've only used the quantifiers to give the crudest possible answers to the question "How many dogs have fleas?": "All," "None," "Some,"

More information

Introducing Proof 1. hsn.uk.net. Contents

Introducing Proof 1. hsn.uk.net. Contents Contents 1 1 Introduction 1 What is proof? 1 Statements, Definitions and Euler Diagrams 1 Statements 1 Definitions Our first proof Euler diagrams 4 3 Logical Connectives 5 Negation 6 Conjunction 7 Disjunction

More information

Proseminar on Semantic Theory Fall 2013 Ling 720 Propositional Logic: Syntax and Natural Deduction 1

Proseminar on Semantic Theory Fall 2013 Ling 720 Propositional Logic: Syntax and Natural Deduction 1 Propositional Logic: Syntax and Natural Deduction 1 The Plot That Will Unfold I want to provide some key historical and intellectual context to the model theoretic approach to natural language semantics,

More information

CS589 Principles of DB Systems Fall 2008 Lecture 4e: Logic (Model-theoretic view of a DB) Lois Delcambre

CS589 Principles of DB Systems Fall 2008 Lecture 4e: Logic (Model-theoretic view of a DB) Lois Delcambre CS589 Principles of DB Systems Fall 2008 Lecture 4e: Logic (Model-theoretic view of a DB) Lois Delcambre lmd@cs.pdx.edu 503 725-2405 Goals for today Review propositional logic (including truth assignment)

More information

MATH 3325: NOTES TO ACCOMPANY LECTURES. Lecture 1

MATH 3325: NOTES TO ACCOMPANY LECTURES. Lecture 1 MATH 3325: NOTES TO ACCOMPANY LECTURES VERN I. PAULSEN Abstract. This notes are intended to supplement the in class lectures. Lecture 1 1. Inductive vs Deductive Reasoning Inductive reasoning is the means

More information

Problem Set 1 Solutions

Problem Set 1 Solutions 6.04/18.06J Mathematics for Computer Science February 1, 005 Srini Devadas and Eric Lehman Problem Set 1 Solutions Due: Monday, February 7 at 9 PM Problem 1. The connectives (and), (or), and (implies)

More information

Philosophy 240 Symbolic Logic Russell Marcus Hamilton College Fall 2014

Philosophy 240 Symbolic Logic Russell Marcus Hamilton College Fall 2014 Philosophy 240 Symbolic Logic Russell Marcus Hamilton College Fall 2014 Class #23 - Translation into Predicate Logic II ( 3.2) Only as a Quantifier P Only Ps are Qs is logically equivalent to all Qs are

More information

Predicate Logic. Predicates. Math 173 February 9, 2010

Predicate Logic. Predicates. Math 173 February 9, 2010 Math 173 February 9, 2010 Predicate Logic We have now seen two ways to translate English sentences into mathematical symbols. We can capture the logical form of a sentence using propositional logic: variables

More information

What is a proof? Proofing as a social process, a communication art.

What is a proof? Proofing as a social process, a communication art. Proof Methods What is a proof? Proofing as a social process, a communication art. Theoretically, a proof of a mathematical statement is no different than a logically valid argument starting with some premises

More information

Discrete Mathematics and Probability Theory Fall 2012 Vazirani Note 1

Discrete Mathematics and Probability Theory Fall 2012 Vazirani Note 1 CS 70 Discrete Mathematics and Probability Theory Fall 2012 Vazirani Note 1 Course Outline CS70 is a course on "Discrete Mathematics and Probability for Computer Scientists." The purpose of the course

More information

Chapter 1 Elementary Logic

Chapter 1 Elementary Logic 2017-2018 Chapter 1 Elementary Logic The study of logic is the study of the principles and methods used in distinguishing valid arguments from those that are not valid. The aim of this chapter is to help

More information

Propositional and First-Order Logic

Propositional and First-Order Logic Propositional and irst-order Logic 1 Propositional Logic 2 Propositional logic Proposition : A proposition is classified as a declarative sentence which is either true or false. eg: 1) It rained yesterday.

More information

Chapter 1: The Logic of Compound Statements. January 7, 2008

Chapter 1: The Logic of Compound Statements. January 7, 2008 Chapter 1: The Logic of Compound Statements January 7, 2008 Outline 1 1.1 Logical Form and Logical Equivalence 2 1.2 Conditional Statements 3 1.3 Valid and Invalid Arguments Central notion of deductive

More information

Propositional Logic: Syntax

Propositional Logic: Syntax Logic Logic is a tool for formalizing reasoning. There are lots of different logics: probabilistic logic: for reasoning about probability temporal logic: for reasoning about time (and programs) epistemic

More information

Functions. Computers take inputs and produce outputs, just like functions in math! Mathematical functions can be expressed in two ways:

Functions. Computers take inputs and produce outputs, just like functions in math! Mathematical functions can be expressed in two ways: Boolean Algebra (1) Functions Computers take inputs and produce outputs, just like functions in math! Mathematical functions can be expressed in two ways: An expression is finite but not unique f(x,y)

More information

Proving logical equivalencies (1.3)

Proving logical equivalencies (1.3) EECS 203 Spring 2016 Lecture 2 Page 1 of 6 Proving logical equivalencies (1.3) One thing we d like to do is prove that two logical statements are the same, or prove that they aren t. Vocabulary time In

More information

Logic and Modelling. Introduction to Predicate Logic. Jörg Endrullis. VU University Amsterdam

Logic and Modelling. Introduction to Predicate Logic. Jörg Endrullis. VU University Amsterdam Logic and Modelling Introduction to Predicate Logic Jörg Endrullis VU University Amsterdam Predicate Logic In propositional logic there are: propositional variables p, q, r,... that can be T or F In predicate

More information

THE LOGIC OF QUANTIFIED STATEMENTS

THE LOGIC OF QUANTIFIED STATEMENTS CHAPTER 3 THE LOGIC OF QUANTIFIED STATEMENTS Copyright Cengage Learning. All rights reserved. SECTION 3.2 Predicates and Quantified Statements II Copyright Cengage Learning. All rights reserved. Negations

More information

Discrete Mathematics for CS Spring 2006 Forbes HW 1 Solutions

Discrete Mathematics for CS Spring 2006 Forbes HW 1 Solutions CompSci 102 Discrete Mathematics for CS Spring 2006 Forbes HW 1 Solutions 1. (2 pts.) Basics Thanks for your responses 2. (13 pts.) Book problems - Warmup for Recitation (a) 1.2 Exercise 36: The statement

More information

Discrete Mathematics and Its Applications

Discrete Mathematics and Its Applications Discrete Mathematics and Its Applications Lecture 1: The Foundations: Logic and Proofs (1.3-1.5) MING GAO DASE @ ECNU (for course related communications) mgao@dase.ecnu.edu.cn Sep. 19, 2017 Outline 1 Logical

More information

INSTITIÚID TEICNEOLAÍOCHTA CHEATHARLACH INSTITUTE OF TECHNOLOGY CARLOW PREDICATE LOGIC

INSTITIÚID TEICNEOLAÍOCHTA CHEATHARLACH INSTITUTE OF TECHNOLOGY CARLOW PREDICATE LOGIC 1 CHAPTER 7. PREDICATE LOGIC 1 INSTITIÚID TEICNEOLAÍOCHTA CHEATHARLACH INSTITUTE OF TECHNOLOGY CARLOW PREDICATE LOGIC 1 Predicate Logic 1.1 Introduction There are various arguments which cannot be dealt

More information

Logic. Propositional Logic: Syntax

Logic. Propositional Logic: Syntax Logic Propositional Logic: Syntax Logic is a tool for formalizing reasoning. There are lots of different logics: probabilistic logic: for reasoning about probability temporal logic: for reasoning about

More information

Learning Goals of CS245 Logic and Computation

Learning Goals of CS245 Logic and Computation Learning Goals of CS245 Logic and Computation Alice Gao April 27, 2018 Contents 1 Propositional Logic 2 2 Predicate Logic 4 3 Program Verification 6 4 Undecidability 7 1 1 Propositional Logic Introduction

More information

2.1 Start Thinking. 2.1 Warm Up. 2.1 Cumulative Review Warm Up

2.1 Start Thinking. 2.1 Warm Up. 2.1 Cumulative Review Warm Up 2.1 Start Thinking The statement If you are able to open the door, then the door is unlocked is always true. Write a statement you know to be true in the same if-then form. Support your statement with

More information

Logical Structures in Natural Language: First order Logic (FoL)

Logical Structures in Natural Language: First order Logic (FoL) Logical Structures in Natural Language: First order Logic (FoL) Raffaella Bernardi Università degli Studi di Trento e-mail: bernardi@disi.unitn.it Contents 1 How far can we go with PL?................................

More information

Logic Background (1A) Young W. Lim 12/14/15

Logic Background (1A) Young W. Lim 12/14/15 Young W. Lim 12/14/15 Copyright (c) 2014-2015 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any

More information

Truth Tables for Arguments

Truth Tables for Arguments ruth ables for Arguments 1. Comparing Statements: We ve looked at SINGLE propositions and assessed the truth values listed under their main operators to determine whether they were tautologous, self-contradictory,

More information

Predicate Logic Quantifier Rules

Predicate Logic Quantifier Rules Predicate Logic Quantifier Rules CS251 at CCUT, Spring 2017 David Lu May 8 th, 2017 Contents 1. Universal Instantiation (UI) 2. Existential Generalization (EG) 3. Universal Generalization (UG) 4. Existential

More information

Before you get started, make sure you ve read Chapter 1, which sets the tone for the work we will begin doing here.

Before you get started, make sure you ve read Chapter 1, which sets the tone for the work we will begin doing here. Chapter 2 Mathematics and Logic Before you get started, make sure you ve read Chapter 1, which sets the tone for the work we will begin doing here. 2.1 A Taste of Number Theory In this section, we will

More information

What are the recursion theoretic properties of a set of axioms? Understanding a paper by William Craig Armando B. Matos

What are the recursion theoretic properties of a set of axioms? Understanding a paper by William Craig Armando B. Matos What are the recursion theoretic properties of a set of axioms? Understanding a paper by William Craig Armando B. Matos armandobcm@yahoo.com February 5, 2014 Abstract This note is for personal use. It

More information

Intermediate Logic. First-Order Logic

Intermediate Logic. First-Order Logic Intermediate Logic Lecture Four First-Order Logic Rob Trueman rob.trueman@york.ac.uk University of York Introducing First-Order Logic First-Order Logic Introducing First-Order Logic Names Predicates Quantifiers

More information

Introduction to Sets and Logic (MATH 1190)

Introduction to Sets and Logic (MATH 1190) Introduction to Sets Logic () Instructor: Email: shenlili@yorku.ca Department of Mathematics Statistics York University Sept 18, 2014 Outline 1 2 Tautologies Definition A tautology is a compound proposition

More information

COMP219: Artificial Intelligence. Lecture 19: Logic for KR

COMP219: Artificial Intelligence. Lecture 19: Logic for KR COMP219: Artificial Intelligence Lecture 19: Logic for KR 1 Overview Last time Expert Systems and Ontologies Today Logic as a knowledge representation scheme Propositional Logic Syntax Semantics Proof

More information

DISCRETE MATHEMATICS BA202

DISCRETE MATHEMATICS BA202 TOPIC 1 BASIC LOGIC This topic deals with propositional logic, logical connectives and truth tables and validity. Predicate logic, universal and existential quantification are discussed 1.1 PROPOSITION

More information

Philosophy 148 Announcements & Such

Philosophy 148 Announcements & Such Branden Fitelson Philosophy 148 Lecture 1 Philosophy 148 Announcements & Such Overall, people did very well on the mid-term (µ = 90, σ = 16). HW #2 graded will be posted very soon. Raul won t be able to

More information

Class 29 - November 3 Semantics for Predicate Logic

Class 29 - November 3 Semantics for Predicate Logic Philosophy 240: Symbolic Logic Fall 2010 Mondays, Wednesdays, Fridays: 9am - 9:50am Hamilton College Russell Marcus rmarcus1@hamilton.edu Class 29 - November 3 Semantics for Predicate Logic I. Proof Theory

More information

Section 1.2: Propositional Logic

Section 1.2: Propositional Logic Section 1.2: Propositional Logic January 17, 2017 Abstract Now we re going to use the tools of formal logic to reach logical conclusions ( prove theorems ) based on wffs formed by some given statements.

More information

Final Exam Theory Quiz Answer Page

Final Exam Theory Quiz Answer Page Philosophy 120 Introduction to Logic Final Exam Theory Quiz Answer Page 1. (a) is a wff (and a sentence); its outer parentheses have been omitted, which is permissible. (b) is also a wff; the variable

More information

FORMAL PROOFS DONU ARAPURA

FORMAL PROOFS DONU ARAPURA FORMAL PROOFS DONU ARAPURA This is a supplement for M385 on formal proofs in propositional logic. Rather than following the presentation of Rubin, I want to use a slightly different set of rules which

More information

A Quick Lesson on Negation

A Quick Lesson on Negation A Quick Lesson on Negation Several of the argument forms we have looked at (modus tollens and disjunctive syllogism, for valid forms; denying the antecedent for invalid) involve a type of statement which

More information

First Order Logic (1A) Young W. Lim 11/18/13

First Order Logic (1A) Young W. Lim 11/18/13 Copyright (c) 2013. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software

More information

Exercise Set 1 Solutions Math 2020 Due: January 30, Find the truth tables of each of the following compound statements.

Exercise Set 1 Solutions Math 2020 Due: January 30, Find the truth tables of each of the following compound statements. 1. Find the truth tables of each of the following compound statements. (a) ( (p q)) (p q), p q p q (p q) q p q ( (p q)) (p q) 0 0 0 1 1 1 1 0 1 0 1 0 0 0 1 0 0 1 1 1 1 1 1 1 0 0 1 0 (b) [p ( p q)] [( (p

More information