For Wednesday, read chapter 6, section 1. As nongraded HW, do the problems on p. 179. Graded Homework #7 is due on Friday at the beginning of class. In.

Slides:



Advertisements
Similar presentations
Quantifiers and logical inference
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.
Exam #3 will be given on Monday Nongraded Homework: Now that we are familiar with the universal quantifier, try
© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Sixth Edition, Mc Graw-Hill, 2007 Chapter 1: (Part 2): The Foundations: Logic and Proofs.
L41 Lecture 2: Predicates and Quantifiers.. L42 Agenda Predicates and Quantifiers –Existential Quantifier  –Universal Quantifier 
For Wednesday, read Chapter 3, section 4. Nongraded Homework: Problems at the end of section 4, set I only; Power of Logic web tutor, 7.4, A, B, and C.
Today’s Topics Limits to the Usefulness of Venn’s Diagrams Predicates (Properties and Relations) Variables (free, bound, individual, constants)
Knowledge Representation Methods
FOL Practice. Models A model for FOL requires 3 things: A set of things in the world called the UD A list of constants A list of predicates, relations,
Section 1.4: Nested Quantifiers We will now look more closely at how quantifiers can be nested in a proposition and how to interpret more complicated logical.
Proofs in Predicate Logic A rule of inference applies only if the main operator of the line is the right main operator. So if the line is a simple statement,
Exam #3 is Friday. It will consist of proofs, plus symbolizations in predicate logic.
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.
For Wed, read Chapter 3, section 3. Nongraded Homework: Exercises the end of the section. Even better, do Power of Logic, 7.3, A and B. Graded homework.
For Friday, read chapter 2, sections 1-2 (pp ). As nongraded homework, do the problems on p. 19. Graded homework #1 is due at the beginning of class.
Review Test 5 You need to know: How to symbolize sentences that include quantifiers of overlapping scope Definitions: Quantificational truth, falsity and.
March 5: more on quantifiers We have encountered formulas and sentences that include multiple quantifiers: Take, for example: UD: People in Michael’s office.
Reading: Chapter 4, section 4 Nongraded Homework: Problems at the end of section 4. Graded Homework #4 is due at the beginning of class on Friday. You.
Formal Logic Mathematical Structures for Computer Science Chapter 1 Copyright © 2006 W.H. Freeman & Co.MSCS SlidesFormal Logic.
PL continued: Quantifiers and the syntax of PL 1. Quantifiers of PL 1. Quantifier symbols 2. Variables used with quantifiers 2. Truth functional compounds.
Symbolization in Predicate Logic In Predicate Logic, statements predicate properties of specific individuals or members of a group. Singular Statement:
No man will lift a lance against another. There never was much undergrowth in Boeotia, Such a smooth place, and this girl takes after it. All woes shall.
Predicate Logic What is a predicate? A property that can be attributed to --or said of –a thing. Being greenBeing contingent Being four feet tall Being.
Section 1.3: Predicates and Quantifiers
Predicates and Quantifiers
The Foundations: Logic and Proofs
Discrete Maths Objective to introduce predicate logic (also called the predicate calculus) , Semester 2, Predicate Logic 1.
Important note. All references to ‘For At Least One Thing:’ FALOT’ have been replaced with ‘There is something such that:’ ‘TISS’ Important Change.
Formal Logic Mathematical Structures for Computer Science Chapter Copyright © 2006 W.H. Freeman & Co.MSCS SlidesFormal Logic.
Proofs in Predicate Logic A rule of inference applies only if the main operator of the line is the right main operator. So if the line is a simple statement,
Working with Word Problems IM1. Objectives Students will be able to:  translate word problems into equations with a single variable.  solve equations.
Week 2 - Wednesday.  What did we talk about last time?  Arguments  Digital logic circuits  Predicate logic  Universal quantifier  Existential quantifier.
1 Predicates and Quantifiers CS/APMA 202, Spring 2005 Rosen, section 1.3 Aaron Bloomfield.
Quantifiers, Predicates, and Names Kareem Khalifa Department of Philosophy Middlebury College Universals, by Dena Shottenkirk.
Chapter 1, Part II: Predicate Logic With Question/Answer Animations.
PART TWO PREDICATE LOGIC. Chapter Seven Predicate Logic Symbolization.
For Wednesday, read chapter 2, sections 3 and 4. As nongraded homework, do the problems at the end each section. Also try exercises 7.1, C, D, and E on.
Introduction to Quantification Chapter 9 Language, Proof and Logic.
Chapter 1, Part II: Predicate Logic With Question/Answer Animations.
Lecture 1.2: Equivalences, and Predicate Logic* CS 250, Discrete Structures, Fall 2011 Nitesh Saxena *Adopted from previous lectures by Cinda Heeren, Zeph.
Section Predicates & Quantifiers. Open Statement 2 x > 8 p < q -5 x = y + 6 Neither true nor false.
Discrete Mathematics. Predicates - the universal quantifier 11/28/2015 Suppose P(x) is a predicate on some universe of discourse. Ex. B(x) = “x is carrying.
1 Introduction to Abstract Mathematics Predicate Logic Instructor: Hayk Melikya Purpose of Section: To introduce predicate logic (or.
No new reading for Wednesday. Keep working on chapter 5, section 3. Exam #3 is next Monday.
Lecture 1.2: Equivalences, and Predicate Logic CS 250, Discrete Structures, Fall 2015 Nitesh Saxena Adopted from previous lectures by Cinda Heeren, Zeph.
80-210: Logic & Proofs July 30, 2009 Karin Howe
Chapter 9: Syntax and Semantics II : Logic & Proofs July 23, 2009 Karin Howe.
Week 2 - Wednesday.  What did we talk about last time?  Arguments  Digital logic circuits  Predicate logic  Universal quantifier  Existential quantifier.
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.
Section 1.5 and 1.6 Predicates and Quantifiers. Vocabulary Predicate Domain Universal Quantifier Existential Quantifier Counterexample Free variable Bound.
Review for Final Exam : Logic & Proofs August 6, 2009 Karin Howe.
For Friday, read Chapter 2, section 5. As nongraded homework, do the problems at the end of the section. I sent out graded HW#2 yesterday. It’s due on.
1 Section 7.1 First-Order Predicate Calculus Predicate calculus studies the internal structure of sentences where subjects are applied to predicates existentially.
Last Answer LETTER I h(x) = 3x 4 – 8x Last Answer LETTER R Without graphing, solve this polynomial: y = x 3 – 12x x.
Lecture 1-3: Quantifiers and Predicates. Variables –A variable is a symbol that stands for an individual in a collection or set. –Example, a variable.
رياضيات متقطعة لعلوم الحاسب MATH 226. Chapter 1 Predicates and Quantifiers 1.4.
Sec. 4-3: Matrix Multiplication 8/24/17
8.1 Symbols and Translation
Quantifiers and logical inference
Testing simple quantification schemas for satisfiability
Rules of inference for quantifiers
Today’s Topics Universes of Discourse
CS201: Data Structures and Discrete Mathematics I
1.2 Analyzing Graphs of Functions and Relations
For Wednesday, read chapter 8, section 2 (pp )
Proofs in Predicate Logic
Predicates and Quantifiers
Predicate Logic Hurley 8.1 Translation.
CS201: Data Structures and Discrete Mathematics I
Presentation transcript:

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 connection with symbolization, try (9.1, C, D, E and F – see ‘help’ link for symbol use; note about upside-down ‘A’) Office hours today are 12-1 only. I’ll be in my office tomorrow, as a make-up.

Guidelines for symbolization in LMPL: 1. When using the universal quantifier in translation, use an arrow as the main operator within the scope of the quantifier (almost always). All philosophers are mortal: (  x)(Px → Mx) In other words, for every single thing in the universe, if it’s a philosopher, then it’s mortal.

No trees are animals. (  x)(Tx → ~ Ax) The group you’re talking about in its entirety is the group of trees. What does ‘(  x)(Tx & ~ Ax)’ say? For anything in the universe, it is a tree and not an animal. In other words, everything in the universe is a tree and not an animal. This formula is well formed and it has truth-conditions, but it’s unlikely to appear in a symbolization, because it’s unlikely anyone would ever say something with that formula’s truth-conditions.

Exceptions What about, “Everything has mass and charge”? (  x)(Mx & Cx) is the right translation, but this is a very rare case where the speaker wants to say that both predicates apply to every single thing in the universe.

B. All people are happy. Looks like it should be (  x)(Px → Hx) But since Forbes allows persons to be a domain of discourse, we don’t actually need ‘Px’ or the arrow (  x)Hx is fine. Let the dictionary be your guide on HW and exams. If ‘P_: _ is a person’ appears in the dictionary, use it in your symbolization.

2. When using the existential quantifier, an ampersand should be the main connective within the scope of the quantifier (almost always). Some philosophers are happy. (P_: _ is a philosopher; H_: _ is happy) (  x)(Px & Hx)

Why not (  x)(Px → Hx)? It’s well formed, but it doesn’t have the right truth-conditions. It says, “for at least one thing P_ → H_ is true” (with the same thing put in both blanks). But it’s too easy to make P_ → H_ true. Just find something that isn’t a philosopher (use a table, for example). F → [any truth-value] is true.

Exceptions? What about, “Something is either rotten or dead”? (  x)(Rx v Dx) is the right answer, but this is a rare case. Even here, the person speaking would probably mean “Something in here is either rotten or dead.” How would you translate that?

3. When using the universal quantifier in translation, put the group you wish to talk about in its entirety to the left of the arrow that is the m.c. inside the scope of the universal quantifier. All frogs are green. (  x)(Fx → Gx) ‘Fx’ is the antecedent because we want to say something about all frogs, not about all green things.

What about this one? Only U.S. citizens are allowed to be president. (Cx: x is a U.S. citizen; Ax: x is allowed to be president) (  x)(Ax → Cx) We want to say something about all people allowed to be president, not about all U.S. citizens.

4. When translating, group a noun and its modifier together around an ampersand. All green frogs are poisonous. (  x)[(Gx & Fx) → Px] All frogs from Brazil are poisonous. (  x)[(Fx & Bx) → Px]

Every philosopher who lives in Brazil speaks German. (  x)[(Px & Bx) → Sx] All frogs are slimy amphibians. (  x)[Fx → (Sx & Ax)] Some rich philosophers are humble. (  x)[(Rx & Px) & Hx]

When should a quantifier not be the main operator of a predicate logic symbolization? Some philosophers are good, and some philosophers are not good. (  x)(Px & Gx) & (  x)(Px & ~ Gx) There are two quantifiers, but neither is the main connective.

Guidelines for deciding whether the initial quantifier should be the main operator: 1. Apply the sandwich principle: Everything between an associated ‘either’ and ‘or’ or ‘if’ and ‘then’ should be grouped together. If any witness told the truth, then George is guilty. (W_: _ is a witness; T_: _ told the truth; G_: _ is guilty; g: George)

(  x)(Wx & Tx) → Gg Either all of the witnesses told the truth, or George is guilty. (G_: _ is guilty; T_: _ told the truth; W_: _ is a witness; g: George) (  x)(Wx → Tx) v Gg

2. BUT, if, each time you pick a value for x, you want to talk about the same thing throughout the entire instance, the initial quantifier should be the m.c. If any witness told the truth, then he or she is honest. (T_: _ told the truth; W_: _ is a witness; H_: _ is honest) (  x)[(Wx & Tx) → Hx]

Speakers have their names listed in the program only if they are famous. (Sx: x is a speaker; Px: x’s name is listed in the program; Fx: x is famous) (  x)[(Sx & Px) → Fx]

Some experienced mechanics are well paid only if all the inexperienced ones are lazy. (E_: _ is experienced; M_: _ is a mechanic; W_: _ is well paid; L_: _ is lazy) (  x)[(Ex & Mx) & Wx] → (  x)[(Mx & ~Ex) → Lx ]