1. 2 EXAM #3 25 translations from English into Predicate Logic 4 points each Only final formula is graded. Do intermediate work on scratch paper.

Slides:



Advertisements
Similar presentations
1.3 Predicates and Quantifiers
Advertisements

1. 2   x Rxk no-one respects Kay  x Rxk everyone respects Kay  x Rjx Jay respects someone  x Rjx Jay respects everyone   x Rjx Jay respects no.
Single Quantifier, Multiple Predicates xx there is some x there is some one some Student Respects Jay AND Rxj  Sx )( who is a student who respects Jay.
Nested Quantifiers Needed to express statements with multiple variables Example 1: “x+y = y+x for all real numbers”  x  y(x+y = y+x) where the domains.
The Foundations: Logic and Proofs
Section 1.3. More Logical Equivalences Constructing New Logical Equivalences We can show that two expressions are logically equivalent by developing.
Chapter 1: The Foundations: Logic and Proofs 1.1 Propositional Logic 1.2 Propositional Equivalences 1.3 Predicates and Quantifiers 1.4 Nested Quantifiers.
Exam #3 will be given on Monday Nongraded Homework: Now that we are familiar with the universal quantifier, try
Predicate Calculus Formal Methods in Verification of Computer Systems Jeremy Johnson.
1. 2 Exam 1:Sentential LogicTranslations (+) Exam 2:Sentential LogicDerivations Exam 3:Predicate LogicTranslations Exam 4:Predicate LogicDerivations Exam.
Propositions and Connectives Conditionals and Bi-conditionals Quantifiers.
1. 2 Exam 1Sentential LogicTranslations (+) Exam 2Sentential LogicDerivations Exam 3Predicate LogicTranslations Exam 4Predicate LogicDerivations 6
2009/91 Predicates and Quantifiers (§1.3) In the sentence “x is greater than 3”: The phrase “x” denotes the subject - the object or entity that the sentence.
Today’s Topics Relational predicates Multiple quantification Expansions of relational predicates.
First-Order Logic. Limitations of propositional logic Suppose you want to say “All humans are mortal” –In propositional logic, you would need ~6.7 billion.
Exam 1:Sentential LogicTranslations (+) Exam 2:Sentential LogicDerivations Exam 3:Predicate LogicTranslations Exam 4:Predicate LogicDerivations.
Hx xx x is happythere is some x : who is happythere is someone is happysomeone.
Exam #3 is Friday. It will consist of proofs, plus symbolizations in predicate logic.
For Wednesday, read chapter 6, section 1. As nongraded HW, do the problems on p Graded Homework #7 is due on Friday at the beginning of class. In.
For Friday, read chapter 6, section 2. As nongraded HW, do the problems on p Graded Homework #7 is due on Friday at the beginning of class.
every Grespectsevery F some Grespectsevery F every Grespectssome F some Grespectssome F Kayrespectsevery F Kayrespectssome F every FrespectsJay.
Predicate Calculus Subject / Predicate John / went to the store. The sky / is blue. Propositional Logic - uses statements Predicate Calculus - uses predicates.
derivations in Predicate Logic 15 points each, plus 10 free points 1.universal derivation[Exercise Set C] 2.existential-out[Exercise Set D] 3.negation.
Lesson #13 The Binomial Distribution. If X follows a Binomial distribution, with parameters n and p, we use the notation X ~ B(n, p) p x (1-p) (n-x) f(x)
1. 2 Exam 1Sentential LogicTranslations (+) Exam 2Sentential LogicDerivations Exam 3Predicate LogicTranslations Exam 4Predicate LogicDerivations 6
The Semantic Web – WEEK 10: Introduction to Description Logics The “Layer Cake” Model – [From Rector & Horrocks Semantic Web cuurse] We are back down to.
1 Predicates and Quantifiers CS 202, Spring 2007 Epp, Sections 2.1 and 2.2 Aaron Bloomfield.
Predicates and Quantifiers
Section 1.3: Predicates and Quantifiers
Predicates and Quantifiers
Chapter 1: The Foundations: Logic and Proofs
CSci 2011 Discrete Mathematics Lecture 3 CSci 2011.
The Foundations: Logic and Proofs
Discrete Maths Objective to introduce predicate logic (also called the predicate calculus) , Semester 2, Predicate Logic 1.
Logical Equivalence & Predicate Logic
CS 103 Discrete Structures Lecture 05
1 Predicates and Quantifiers CS/APMA 202, Spring 2005 Rosen, section 1.3 Aaron Bloomfield.
Nested Quantifiers. 2 Nested Iteration Let the domain be {1, 2, …, 10}. Let P(x, y) denote x > y.  x,  y, P(x, y) means  x, (  y, P(x, y) ) Is the.
Chapter 1, Part II: Predicate Logic With Question/Answer Animations.
Logic Disjunction A disjunction is a compound statement formed by combining two simple sentences using the word “OR”. A disjunction is true when at.
© Jalal Kawash 2010Peeking into Computer Science George Boole English Mathematician His The Mathematical Analysis of Logic, 1848 is the first.
Инвестиционный паспорт Муниципального образования «Целинский район»
Chapter 1, Part II: Predicate Logic With Question/Answer Animations.
Chapter 1: The Foundations: Logic and Proofs 1.1 Propositional Logic 1.2 Propositional Equivalences 1.3 Predicates and Quantifiers 1.4 Nested Quantifiers.
Statements with Multiple Quantifiers. When a statement contains more than one quantifier, we imagine the actions suggested by the quantifiers as being.
(x – 8) (x + 8) = 0 x – 8 = 0 x + 8 = x = 8 x = (x + 5) (x + 2) = 0 x + 5 = 0 x + 2 = x = - 5 x = - 2.
Math 51/COEN 19 Day 3, 1.4 Quantifiers 1. 3 Predicates A lot like functions that return booleans Let P(x) denote x
Nested Quantifiers Section 1.5.
Rules of Inference Section 1.6. Arguments in Propositional Logic A argument in propositional logic is a sequence of propositions. All but the final proposition.
80-210: Logic & Proofs July 30, 2009 Karin Howe
Statements Containing Multiple Quantifiers Lecture 11 Section 2.3 Mon, Feb 5, 2007.
1 Outline Quantifiers and predicates Translation of English sentences Predicate formulas with single variable Predicate formulas involving multiple variables.
Mathematics for Comter I Lecture 3: Logic (2) Propositional Equivalences Predicates and Quantifiers.
Section 1.4. Propositional Functions Propositional functions become propositions (and have truth values) when their variables are each replaced by a value.
Section 1.5. Section Summary Nested Quantifiers Order of Quantifiers Translating from Nested Quantifiers into English Translating Mathematical Statements.
공무원연금관리공단 광주지부 공무원대부등 공적연금 연계제도 공무원연금관리공단 광주지부. 공적연금 연계제도 국민연금과 직역연금 ( 공무원 / 사학 / 군인 / 별정우체국 ) 간의 연계가 이루어지지 않고 있 어 공적연금의 사각지대가 발생해 노후생활안정 달성 미흡 연계제도 시행전.
Жюль Верн ( ). Я мальчиком мечтал, читая Жюля Верна, Что тени вымысла плоть обретут для нас; Что поплывет судно громадней «Грейт Истерна»; Что.
Uniqueness Quantifier ROI for Quantified Statement.
رياضيات متقطعة لعلوم الحاسب MATH 226. Chapter 1 Predicates and Quantifiers 1.4.
CSE15 Discrete Mathematics 01/25/17
Chapter 1 The Foundations: Logic and Proofs
The Foundations: Logic and Proofs
CS201: Data Structures and Discrete Mathematics I
Nested Quantifiers Nested quantifiers are often necessary to express the meaning of sentences in English as well as important concepts in computer science.
CSE 321 Discrete Structures
Xuan Guo Lab 3 Xuan Guo
George Boole English Mathematician
Predicates and Quantifiers
CS201: Data Structures and Discrete Mathematics I
The Foundations: Logic and Proofs
Presentation transcript:

1

2 EXAM #3 25 translations from English into Predicate Logic 4 points each Only final formula is graded. Do intermediate work on scratch paper.

3 if anyone is F, then everyone is H16i‘any’ if everyone is F, then everyone is H36hmultiple quantification every A and B is C16g disjunctive combinations every F S is HAPPY16econjunctive combinations only SENIORS are HAPPY16f‘only’ every SENIOR is HAPPY26cspecified quantifiers everyone is HAPPY26bsimple quantifiers JAY and KAY are HAPPY26aun-quantified formulas example# HW Chapter 6

4 every F RESPECTS some G27d2 quantifiers, 3 predicates no STUDENT RESPECTS everyone27c2 quantifiers, 2 predicates everyone RESPECTS someone27b2 quantifiers, 1 predicate KAY RESPECTS every STUDENT21 quantifier, 2 predicates everyone RESPECTS KAY27a1 quantifier, 1 predicate Example# HW Chapter 7 every one who RESPECTS every F RESPECTS every G 27ecomplex predicates

5   x Rxj no-one respects Jay  x Rxk every one respects Kay  x Rjx Jay respects some one   x ( Fx & Rxj ) no F respects Jay  x ( Fx  Rxk ) every F respects Kay  x ( Fx & Rjx ) Jay respects some F

6  x   y Ryx there is someone whom no-one respects  x   y Rxy there is someone who respects no-one  x  y Ryx there is someone whom everyone R’s  x  y Rxy everyone respects someone (or other)   x  y Ryx no-one is respected by everyone   x  y Rxy no-one respects everyone  x  y Rxy someone respects someone  x  y Rxy everyone respects everyone

7  x  y ( Gy & Rxy ) there is someone who R’s no G  x ( Fx &  yRxy ) there is some F who R’s everyone   x  y ( Gy  Rxy ) no one respects every G  x ( Fx   yRxy ) every F respects someone (or other)  x  y ( Gy & Rxy ) some one respects some G  x ( Fx   yRxy ) every F respects everyone

8  x ( Fx &  y(Gy & Rxy) ) there is some F who R’s no G  x ( Fx &  y(Gy  Rxy) ) there is some F who R’s every G   x ( Fx &  y(Gy  Rxy) ) no F respects every G  x ( Fx   y(Gy & Rxy) ) every F respects some G (or other)  x ( Fx &  y(Gy & Rxy) ) some F respects some G  x ( Fx   y(Gy  Rxy) ) every F respects every G

9

10 Simple Predicates PxPx x is a Politician no further analysis required CxCx x is a Citizen Complex Predicates no Citizen Respects x Jay Respects x x Respects everyone must be further analyzed xx x Respects him/herself

11   y ( Cy & Ryx ) no Citizen Respects x  y ( Cy  Ryx ) every Citizen Respects x  y ( Py  Rxy ) x Respects every Pol  y ( Py & Rxy ) x Respects at least one Pol  y Ryx someone Respects x  y Rxy x Respects everyone Rxx x Respects him/herself Rjx Jay Respects x RxkRxk x Respects Kay

12  y ( Py & Rxy ) x R’s at least one P xx Cx xx every citizen respects at least one politician  x { Cx   y ( Py & Rxy ) } respects at least one politicianeverycitizen iseveryC   {} then  you if you are C you are 

13 xx no politician is respected by every citizen  y ( Cy  Ryx ) every C Respects x x is R’ed by every C } &Px xx   x { Px &  y ( Cy  Ryx ) } respected by every citizen nopolitician noP is  there is no one who is Pand who is  {

14 every one who respects every pol is a moron  y ( Py  Rxy ) x R’s every Politician Mx  xx { xx Mis  every  x {  y(Py  Rxy)  Mx } a moronis one who respects every P every } you are Mthen if you are   you

15  x {  y(Py  Rxy)   y(Py  Ryx) } respected by every P every one who respects every Pol is respected by every Pol  y ( Py  Ryx )  y ( Py  Rxy ) x is R’ed by every Px R’s every P xx  xx { xx  is  every } one who R’s every Peveryis you are  then if you are   you

16 xx   x {  y ( Py  Rxy ) & Rxx } who is  and who is  there is no one no one who respects every pol respects him/herself Rxx  y (Py  Rxy ) x R’s him/herself x R’s every P } & xx { xx x is  x is  there is no x :  is  no respects him/herselfone who R’s every Pno

17