Download presentation
Presentation is loading. Please wait.
1
Statements and Quantifiers
Lesson 5.2 Statements and Quantifiers pp
2
Objectives: 1. To define statement as used in logic.
2. To apply quantifiers to statements. 3. To form negations of statements and symbolize them.
3
Definition A statement is a sentence that is either true or false, but not both.
4
Determine whether each of the following are statements, and if so, whether each is true or false.
x + 7 = 4 1. Not a statement 2. True statement 3. False statement
5
Determine whether each of the following are statements, and if so, whether each is true or false.
3 + 5 = 6 1. Not a statement 2. True statement 3. False statement
6
Determine whether each of the following are statements, and if so, whether each is true or false.
This sentence is false. 1. Not a statement 2. True statement 3. False statement
7
Determine whether each of the following are statements, and if so, whether each is true or false.
3x - 9 = 3(x - 3) 1. Not a statement 2. True statement 3. False statement
8
In mathematical logic, statements are usually symbolized by letters such as p or q.
p: Dogs have fleas. q: Baseball is fun.
9
The negation of the statement Geometry is fun
The negation of the statement Geometry is fun! (which is a true statement) is Geometry is not fun! (a false statement). In symbolic logic if the first statement is p, then the negation is ~p.
10
In logical reasoning the words all and every are represented by an upside down A (). All is called the universal quantifier.
11
To negate a universal quantifier you must just show the statement is not true for all.
p: All flowers are pretty. ~p: There exist flowers that are not pretty.
12
To negate a universal quantifier you must just show the statement is not true for all.
p: All flowers are pretty. ~p: Not all flowers are pretty.
13
To negate a universal quantifier you must just show the statement is not true for all.
p: All flowers are pretty. ~p: Some flowers are not pretty.
14
Another type of quantifier is the existential quantifier (), which implies “one or more.”
15
To negate the existential quantifier the statement cannot be true for any.
p: There exists dogs that have fleas. ~p: No dogs have fleas.
16
Examples p: Girls are logical. p: ~p: p: ~p: All girls are logical. Not all girls are logical. Some girls are logical. No girls are logical.
17
Examples p: Cars are expensive. p: ~p: p: ~p: All cars are expensive. Not all cars are expensive. Some cars are expensive. No cars are expensive.
18
Homework pp
19
►B. Exercises Write the following symbolizations in words given: p: Ben Franklin was an inventor. q: Prime numbers are divisible by 2. r: Men are bald. s: Students should study mathematics. 13. r
20
►B. Exercises Write the following symbolizations in words given: p: Ben Franklin was an inventor. q: Prime numbers are divisible by 2. r: Men are bald. s: Students should study mathematics. 15. ~q
21
►B. Exercises Write the following symbolizations in words given: p: Ben Franklin was an inventor. q: Prime numbers are divisible by 2. r: Men are bald. s: Students should study mathematics. 17. s
22
►B. Exercises Write the following symbolizations in words given: p: Ben Franklin was an inventor. q: Prime numbers are divisible by 2. r: Men are bald. s: Students should study mathematics. 19. ~ r
23
■ Cumulative Review True/False 26. All obtuse triangles are scalene.
24
■ Cumulative Review True/False 27. A rhombus is a trapezoid.
25
■ Cumulative Review True/False 28. Some triangles are not convex.
26
■ Cumulative Review True/False 29. No cones are polyhedra.
27
■ Cumulative Review True/False 30. Some half-planes intersect.
Similar presentations
© 2025 SlidePlayer.com. Inc.
All rights reserved.