1 / 24

This is a story about four people named Everybody, Somebody, Anybody and Nobody.

This is a story about four people named Everybody, Somebody, Anybody and Nobody.

lovie
Download Presentation

This is a story about four people named Everybody, Somebody, Anybody and Nobody.

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. This is a story about four people named Everybody, Somebody, Anybody and Nobody. There was an important job to be done and Everybody was sure that Somebody would do it. Anybody could have done it, but Nobody did it. Somebody got angry about that, because it was Everybody's job. Everybody thought that Anybody could do it, but Nobody realized that Everybody wouldn't do it. It ended up that Everybody blamed Somebody when Nobody did what Anybody could have done. RMIT University; Taylor's College

  2. Lecture 8 To apply quantifiers on predicates To apply the de Generalized de Morgan’s Laws To determine the truth value of predicates involving combination of two quantifiers RMIT University; Taylor's College

  3. Universal Quantifiers: All We may says that: “Every student has brains.” • Let be a student. • Let D = All MATH 2111 students. • This is a set – the domain of interpretation. • So “every student has brains” becomes RMIT University; Taylor's College

  4. Universal Quantifiers • Let P(x) represent the predicate: “Student x has brains.” • Then “every student has brains” becomes: or more simply, • When we don’t need to specify the domain, this becomes: RMIT University; Taylor's College

  5. Universal QuantifiersExercise: • Let stand for a tall building more than 10 floors, and • let is made of steel and concrete. • Use the Universal Quantifier to write a predicate. Write also, the meaning of the predicate. RMIT University; Taylor's College

  6. Universal QuantifiersExercise: • For all tall building more than 10 floors (, the building is made of steel and concrete ( is true). RMIT University; Taylor's College

  7. Existential Quantifiers:There Exist • How do we say, “There exists a student with brains”? • How do we say, “Some students have brains”? • In logic, “some” means “at least one”. • This is how we apply one of the quantifiers to a predicate. RMIT University; Taylor's College

  8. Existential QuantifiersExercise: • Let stand for a Deluxe suitein a resort, and • let is empty.  • Use the Existential Quantifier to write a predicate. Write also, the meaning of the predicate. RMIT University; Taylor's College

  9. Existential Quantifiers:There Exist • There exist a deluxe suite in a resort () such that, the resort is empty (is true ). RMIT University; Taylor's College

  10. Quantifiers • A statement involving predicates whose variables are all properly quantified becomes a proposition (provided that the domain is known). RMIT University; Taylor's College

  11. Quantifiers • Example: D = Z = {…, -3, -2, -1, 0, 1, 2, 3, …} • P(x) means “x is positive” • Which are true? • This means “for all x, P(x)” which means “for all x, x is positive.” This is false. A counterexample is x = 0 (or x = -1, etc) • A counterexample is an example which proves that a universally quantified statement is false. • This means “there exists xsuch that P(x) is true” which means “there exists x such that x is positive”. • This is true. For example, x = 1. RMIT University; Taylor's College

  12. Quantifiers • It’s more likely that is true than that is true. • In fact, provided that the domain D is nonempty, RMIT University; Taylor's College

  13. The Generalized de Morgan Laws • What happens if we negate an expression involving predicates and quantifiers? • The Generalized de Morgan Laws • Examples: • “It’s not true that all food is delicious” is the same as “there exists some food which is not delicious.” • “It’s not true that some dogs bite” is the same as “there aren’t any dogs who bite” or equivalently “all dogs don’t bite”. RMIT University; Taylor's College

  14. Combining Quantifiers • A predicate can have numerous variables, each of which may be quantified. • Example • It can be difficult to interpret expressions involving 3 or more quantifiers. Negation RMIT University; Taylor's College

  15. Combination of Quantifiers • Having two quantifiers is a lot easier. • What do these mean? Which are true in any given situation? • This depends on how P(x, y) is defined, and on what set is chosen as the domain of interpretation D. RMIT University; Taylor's College

  16. P(x, y): x is taller than y Everyone is taller than everyone. There exists a person who is taller than everyone. Everyone is taller than someone. Everyone is shorter than someone. There is someone who is shorter than everyone. There is someone who is taller than another person. http://newsimg.bbc.co.uk/media/images/46343000/gif/_46343078_height_world_leaders_466.gif Accessed 29th September 2009 RMIT University; Taylor's College

  17. Example • Suppose P(x, y) means x ≥ y. Let D be the set N \ {0} = {1, 2, 3, …}. • Which of the six predicate formulae given in the previous slide are true? • The discussion is in the following slides. RMIT University; Taylor's College

  18. For all x and (for all) y, P(x, y) is true. • This says that no matter which numbers x and y we choose from N \ {0}, it will always happen that x ≥ y. • Is this true? • No. For example, x = 1 and y = 2. RMIT University; Taylor's College

  19. For all x there exists y such that x ≥ y. • Here y can depend on x. • A different choice of x may lead to a different value of y. • Is this true? • Yes. For example, given x we can take y = x. Then x ≥ y. • Or, we could take y = 1 when x = 1, and take y = x– 1 for all other values of x. Or we could take y = 1 always. RMIT University; Taylor's College

  20. There exists x such that for all y, x ≥ y. • This says that x is a constant, and every choice of y makes x ≥ y. • Is this true? • No. There is no such constant. (It would have to be the biggest integer – the largest element of N \ {0}. But this set has no largest element.) RMIT University; Taylor's College

  21. There exists x and there exists y such that x ≥ y. • Is this true? • Yes. For example, take x = 2 and y = 1. RMIT University; Taylor's College

  22. For all y there exists x such that x ≥ y. • This says that for every choice of y it’s possible to find an x which is ≥ y. • Is this true? • Yes. For example, put x = y + 1 (or take x = y) RMIT University; Taylor's College

  23. There exists y such that for all x, x ≥ y. • This says that there is a constant y which is less than or equal to all values of x. • Is this true? • Yes: y = 1 has this property. It’s the smallest element of the set. RMIT University; Taylor's College

  24. Exercises • How do the results change if D changes to the finite set {1, 2, 3, 4, 5}? • How do the results change if D changes from N \ {0} to Z? • Is there a domain for which all six formulae are true? • How do the results change if P(x, y) changes to “x > y”? RMIT University; Taylor's College

More Related