section 3.1 statements and logical connectives · pdf filestatements and logical connectives...
TRANSCRIPT
1/20/2015
1
Copyright 2013, 2010, 2007, Pearson, Education, Inc.
Section 3.1
Statements and Logical Connectives
Copyright 2013, 2010, 2007, Pearson, Education, Inc.
What You Will Learn - LogicStatements, quantifiers, and compound statements
Statements involving the words not, and, or, if … then, and if and only if
Aristotelian logic: The ancient Greeks were the first people to look at the way humans think and draw conclusions. Aristotle (384-322 B.C.) is called the father of logic. This logic has been taught and studied for more
than 2000 years.
3.1-2
Copyright 2013, 2010, 2007, Pearson, Education, Inc.
MathematiciansGottfried Wilhelm Leibniz (1646-1716) believed that all mathematical and scientific concepts could be derived from logic. He was the first to seriously study symbolic logic. In this type of logic, written statements use symbols and letters.
George Boole (1815 – 1864) is said to be the founder of symbolic logic because he had such impressive work in this area.
Charles Dodgson, better known as Lewis Carroll, incorporated many interesting ideas from logic into his books.
3.1-3
1/20/2015
2
Copyright 2013, 2010, 2007, Pearson, Education, Inc.
Logic and the English Language
Connectives - words such as and, or,
if, then
Exclusive or - one or the other of the
given events can happen, but not
both
Inclusive or - one or the other or
both of the given events can happen
3.1-4
Copyright 2013, 2010, 2007, Pearson, Education, Inc.
Statements and Logical Connectives
Statement - A sentence that can be judged
either true or false.
Labeling a statement true or false is called
assigning a truth value to the statement.
Simple Statements - A sentence that conveys
only one idea and can be assigned a truth value.
Compound Statements - Sentences that
combine two or more simple statements and can
be assigned a truth value.
3.1-5
Copyright 2013, 2010, 2007, Pearson, Education, Inc.
Negation of a Statement
Negation of a statement – change a statement to
its opposite meaning.
The negation of a false statement is always a true
statement.
The negation of a true statement is always a false
statement.
Quantifiers - words such as all, none, no, some, etc…
Be careful when negating statements that contain quantifiers.
3.1-6
1/20/2015
3
Copyright 2013, 2010, 2007, Pearson, Education, Inc.
Negation of Quantified Statements
Form of statement
All are.
None are.
Some are.
Some are not.
Form of negation
Some are not.
Some are.
None are.
All are.
3.1-7
None are.
Some are not.
All are.
Some are.
Copyright 2013, 2010, 2007, Pearson, Education, Inc.
Example 1: Write Negations
Write the negation of the statement.
Some telephones can take photographs.
3.1-8
Copyright 2013, 2010, 2007, Pearson, Education, Inc.
Example 1: Write NegationsWrite the negation of the statement. (at least two ways)
All houses have two stories.
3.1-9
1/20/2015
4
Copyright 2013, 2010, 2007, Pearson, Education, Inc.
Compound StatementsStatements consisting of two or more simple
statements are called compound statements.
The connectives often used to join two simple
statements are and, or, if…then…, and if and
only if.
The symbol used in logic to show the negation of
a statement is ~. It is read “not”.
The negation of p is: ~ p.
3.1-10
Copyright 2013, 2010, 2007, Pearson, Education, Inc.
And Statements (Conjunction)
⋀ is the symbol for a conjunction and
is read “and.” p ⋀ q.
3.1-11
Write the following conjunction in symbolic form:
Green Day is not on tour,
but Green Day is recording a new CD.
Copyright 2013, 2010, 2007, Pearson, Education, Inc.
Or Statements (Disjunction)The disjunction is symbolized by ⋁Let
p: Maria will go to the circus.q: Maria will go to the zoo.
Maria will go to the circus or Maria will go the zoo.
Maria will go to the zoo or Maria will not go the circus.
3.1-12
1/20/2015
5
Copyright 2013, 2010, 2007, Pearson, Education, Inc.
Example 4: Understand How Commas Are Used to Group Statements
Let p: Dinner includes soup.q: Dinner includes salad.r: Dinner includes the vegetable of
the dayWrite the statement in symbolic form.Dinner includes soup, and salad or
vegetable of the day.
3.1-13
Copyright 2013, 2010, 2007, Pearson, Education, Inc.
Let p: Dinner includes soup.q: Dinner includes salad.r: Dinner includes the vegetable of
the dayWrite the statement in symbolic form.Dinner includes soup, and salad or
vegetable of the day.
Write the statement in symbolic form.Dinner includes soup and salad, or
vegetable of the day.
3.1-14
Copyright 2013, 2010, 2007, Pearson, Education, Inc.
Example 5:Let p: The house is for sale.
q: We can afford to buy the house.Write the symbolic statement in words.
p ⋀ ~q
~p ⋁ ~q
~(p ⋀ q)
3.1-15
1/20/2015
6
Copyright 2013, 2010, 2007, Pearson, Education, Inc.
If-Then Statements
The conditional is symbolized by →and is read “if-then.” The antecedent is the part of the statement that comes before the arrow.The consequent is the part that follows the arrow.
If p, then q is symbolized as: p → q.
3.1-16
Copyright 2013, 2010, 2007, Pearson, Education, Inc.
Example 6: Write Conditional Statements
Let p: The portrait is a pastel.q: The portrait is by Beth Anderson.Write the statement symbolically.
If the portrait is a pastel, then the portrait is by Beth Anderson.
Solutionp → q
3.1-17
Copyright 2013, 2010, 2007, Pearson, Education, Inc.
Example 6: Write Conditional Statements
Let p: The portrait is pastel.q: The portrait is by Beth Anderson.Write the statement symbolically.
If the portrait is by Beth Anderson, then the portrait is not a pastel.
Solutionq → ~p
3.1-18
1/20/2015
7
Copyright 2013, 2010, 2007, Pearson, Education, Inc.
Example 6: Write Conditional Statements
Let p: The portrait is pastel.q: The portrait is by Beth Anderson.Write the statement symbolically.
It is false that if the portrait is by Beth Anderson, then the portrait is a pastel.
Solution~(q → p)
3.1-19
Copyright 2013, 2010, 2007, Pearson, Education, Inc.
If and Only If Statements
The biconditional is symbolized by ↔
and is read “if and only if.”
If and only if is sometimes abbreviated
as “iff.”
The statement p ↔ q is read “p if and
only if q.”
3.1-20
Copyright 2013, 2010, 2007, Pearson, Education, Inc.
Example 8: Write Statements Using the BiconditionalLetp: Alex plays goalie on the lacrosse team.q: The Titans win the Champion’s Cup.Write the symbolical statement in words.
p ↔ qSolutionAlex plays goalie on the lacrosse team if
and only if the Titans win the Champion’s Cup.
3.1-21
1/20/2015
8
Copyright 2013, 2010, 2007, Pearson, Education, Inc.
Example 8: Write Statements Using the BiconditionalLetp: Alex plays goalie on the lacrosse team.q: The Titans win the Champion’s Cup.Write the symbolical statement in words.
q ↔ ~pSolutionThe Titans win the Champion’s cup if and
only if Alex does not play goalie on the lacrosse team.
3.1-22
Copyright 2013, 2010, 2007, Pearson, Education, Inc.
Example 8: Write Statements Using the BiconditionalLetp: Alex plays goalie on the lacrosse team.q: The Titans win the Champion’s Cup.Write the symbolical statement in words.
~(p ↔ ~q)SolutionIt is false that Alex plays goalie on the
lacrosse team if and only if the Titans do not win the Champion’s Cup.
3.1-23
Copyright 2013, 2010, 2007, Pearson, Education, Inc.
Logical Connectives
3.1-24
1/20/2015
9
Copyright 2013, 2010, 2007, Pearson, Education, Inc.
Section 3.2
Truth Tables for Negation, Conjunction,
and Disjunction
Copyright 2013, 2010, 2007, Pearson, Education, Inc.
Negation Truth Table
3.2-26
p ~p
Case 1 T F
Case 2 F T
p q
Case 1 T T
Case 2 T F
Case 3 F T
Case 4 F F
Copyright 2013, 2010, 2007, Pearson, Education, Inc.
Conjunction Truth Table
The conjunction is true only when both p and q are true.
3.2-27
p q p ⋀ q
Case 1 T T T
Case 2 T F F
Case 3 F T F
Case 4 F F F
1/20/2015
10
Copyright 2013, 2010, 2007, Pearson, Education, Inc.
Disjunction Truth Table
The disjunction is true when either p is true, q is true, or both p and qare true.
3.2-28
p q p ⋁ q
Case 1 T T T
Case 2 T F T
Case 3 F T T
Case 4 F F F
Copyright 2013, 2010, 2007, Pearson, Education, Inc.
Example 3: Truth Table with a Negation
Construct a truth table for ~(~q ⋁ p).
3.2-29
Copyright 2013, 2010, 2007, Pearson, Education, Inc.
Example 7: Use the Alternative Method to Construct a Truth Table
Construct a truth table for ~p ⋀ ~q.
3.2-30
1/20/2015
11
Copyright 2013, 2010, 2007, Pearson, Education, Inc.
Example 9: Determine the Truth Value of a Compound Statement
Determine the truth value for each simple statement. Then, using these truth values, determine the truth value of the compound statement.
15 is less than or equal to 9.
3.2-31
Copyright 2013, 2010, 2007, Pearson, Education, Inc.
Example 9: Determine the truth value for each simple statement. Then, using these truth values, determine the truth value of the compound statement.George Washington was the first U.S. president or Abraham Lincoln was the second U.S. president, but there has not been a U.S. president born in Antarctica.
p: George Washington was the first U.S. president.q: Abraham Lincoln was the second U.S. president.r: There has been a U.S. president who was born in
Antarctica.
3.2-32
Copyright 2013, 2010, 2007, Pearson, Education, Inc.
Section 3.3
Truth Tables for the
Conditional and
Biconditional
1/20/2015
12
Copyright 2013, 2010, 2007, Pearson, Education, Inc.
Conditional
The conditional statement p → q is true in every case except when p is a true statement and q is a false statement.
3.3-34
p q p → q
Case 1 T T T
Case 2 T F F
Case 3 F T T
Case 4 F F T
Copyright 2013, 2010, 2007, Pearson, Education, Inc.
This leads to some “weird” stuffIf you are in chemistry class right now, then
you have green skin.
Since none of you are in chemistry class
right now, the entire statement is true!
Note: Difference between statement being
true and you having green skin.
1.1-35
Copyright 2013, 2010, 2007, Pearson, Education, Inc.
Construct a truth table for the statement ~p → ~q.
3.3-36
1/20/2015
13
Copyright 2013, 2010, 2007, Pearson, Education, Inc.
Biconditional
The biconditional statement, p ↔ q is true only when p and q have the same truth value, that is, when both are true or both are false.
3.3-37
Copyright 2013, 2010, 2007, Pearson, Education, Inc.
Construct a truth table for the statement ~p ↔ (~q → r).
3.3-38
Copyright 2013, 2010, 2007, Pearson, Education, Inc.
The graph on the next slide represents the student population by age group in 2009 for the State College of Florida (SCF). Determine the truth value of the following statements.
3.3-39
1. If 37% of the SCF population is younger than 21 or 26% of the SCF population is age 21–30, then 13% of the SCF population is age 31–40.
2. 3% of the SCF population is older than 50 and 8% of the SCF population is age 41–50, if and only if 19% of the SCF population is age 21–30.
1/20/2015
14
Copyright 2013, 2010, 2007, Pearson, Education, Inc.
Self-Contradiction
A self-contradiction is a compound statement
that is always false.
A tautology is a compound statement that is
always true.
3.3-40
Copyright 2013, 2010, 2007, Pearson, Education, Inc.
Construct a truth table for the statement (p ↔ q) ⋀ (p ↔ ~q).
3.3-41
Copyright 2013, 2010, 2007, Pearson, Education, Inc.
Construct a truth table for the statement (p ⋀ q) → (p ⋁ r).
3.3-42
1/20/2015
15
Copyright 2013, 2010, 2007, Pearson, Education, Inc.
An implication is a conditional
statement that is a tautology.
Determine whether the conditional
statement [(p ⋀ q) ⋀ q] → q is an
implication.
3.3-43
Copyright 2013, 2010, 2007, Pearson, Education, Inc.
Section 3.4
Equivalent Statements
Copyright 2013, 2010, 2007, Pearson, Education, Inc.
Equivalent Statements
Two statements are equivalent,symbolized ⇔ or ≡, if both statements have exactly the same truth values in the answer columns of the truth tables.Sometimes the words logically equivalent are used in place of the word equivalent.
3.4-45
1/20/2015
16
Copyright 2013, 2010, 2007, Pearson, Education, Inc.
Are the following equivalent?p ⋀ (q ⋁ r) (p ⋀ q) ⋁ (p ⋀ r)
3.4-46
Copyright 2013, 2010, 2007, Pearson, Education, Inc.
Determine which statement is logically equivalent to “it is not true that the tire is both out of balance and flat.”a) if the tire is not flat, then the tire is not out of balance.b) the tire is not out of balance or the tire is not flat.c) the tire is not flat and the tire is not out of balance.d) if the tire is not out of balance, then the tire is not flat.p: The tire is out of balance q: The tire is flat.
3.4-47
Copyright 2013, 2010, 2007, Pearson, Education, Inc.
De Morgan’s Laws
~ (p ∧ q) ⇔ ~ p ∨ ~ q
~ (p ∨ q) ⇔ ~ p ∧ ~ q
3.4-48
1/20/2015
17
Copyright 2013, 2010, 2007, Pearson, Education, Inc.
Example 5: Using De Morgan’s Laws to Write an Equivalent Statement
Write a statement that is logically equivalent to “It is not true that tomatoes are poisonous or eating peppers cures the common cold.”
3.4-49
Copyright 2013, 2010, 2007, Pearson, Education, Inc.
To change a conditional statement into a disjunction, negate the antecedent, change the conditional symbol to a disjunction symbol, and keep the consequent the same.
The Conditional Statement Written as a Disjunction
p→ q ⇔ ~p ∨ q
3.4-50
Copyright 2013, 2010, 2007, Pearson, Education, Inc.
Write a conditional statement that is logically equivalent to “The Oregon Ducks will win or the Oregon State Beavers will lose.” Assume that the negation of winning is losing.
Example 7: Rewriting a Disjunction as a Conditional Statement
3.4-51
1/20/2015
18
Copyright 2013, 2010, 2007, Pearson, Education, Inc.
The Negation of the Conditional Statement Written as a Conjunction
~(p → q) ≡ p ⋀ ~q
3.4-52
Copyright 2013, 2010, 2007, Pearson, Education, Inc.
Example 9: Write an Equivalent Statement
Write a statement that is equivalent to
“It is false that if you hang the picture
then it will be crooked.”
3.4-53
Copyright 2013, 2010, 2007, Pearson, Education, Inc.
Variations of the Conditional Statement
The variations of conditional
statements are the converse of the
conditional, the inverse of the
conditional, and the contrapositive of
the conditional.
3.4-54
1/20/2015
19
Copyright 2013, 2010, 2007, Pearson, Education, Inc.
Variations of the Conditional Statement
Name Symbolic Form
Read
Conditional p → q “If p, then q”
Converse q → p “If q, then p”
Inverse ~p → ~q “If not p, then not q”
Contrapositive ~q → ~p “If not q, then not p”
3.4-55
Copyright 2013, 2010, 2007, Pearson, Education, Inc.
Example 10: The Converse, Inverse, and Contrapositive
For the conditional statement “If the song contains sitar music, then the song was written by George Harrison,” write thea) converse.b) inverse.c) contrapositive.
3.4-56
Copyright 2013, 2010, 2007, Pearson, Education, Inc.
Section 3.6
Euler Diagrams
and Syllogistic Arguments
1/20/2015
20
Copyright 2013, 2010, 2007, Pearson, Education, Inc.
Syllogistic Arguments
Another form of argument is called a
syllogistic argument, better known as
syllogism.
The validity of a syllogistic argument is
determined by using Euler
(pronounced “oiler”) diagrams.
3.6-58
Copyright 2013, 2010, 2007, Pearson, Education, Inc.
Symbolic Arguments Versus Syllogistic Arguments
Euler diagramsall are, some are, none are, some are not
Syllogistic argument
Truth tables or by comparison with standard forms of arguments
and, or, not, if-then, if and only if
Symbolic argument
Methods of determining validity
Words or phrases used
3.6-59
Copyright 2013, 2010, 2007, Pearson, Education, Inc.
Example 3: Ballerinas and Athletes
Determine whether the following syllogism is valid or invalid.
All ballerinas are athletic.
Keyshawn is athletic.
∴ Keyshawn is a ballerina.
3.6-60
1/20/2015
21
Copyright 2013, 2010, 2007, Pearson, Education, Inc.
Example 3: Ballerinas and AthletesSolution
Keyshawn is athletic, so must be placed in the set of athletic people, which is A. We have a choice, as shown above.
All ballerinas, B, are athletic, A.
The conclusion does not necessarily follow from the set of premises. The argument is invalid.
3.6-61
Copyright 2013, 2010, 2007, Pearson, Education, Inc.
Example 4: Parrots and Chickens
Determine whether the following syllogism is valid or invalid.
No parrots eat chicken.
Fletch does not eat chicken.
∴ Fletch is a parrot.
3.6-62
Copyright 2013, 2010, 2007, Pearson, Education, Inc.
Example 4: Parrots and ChickensSolution
The first premise tells us that parrots and things that eat chicken are disjoint sets—that is, sets that do not intersect.
Fletch is not a parrot, the argument is invalid, or is a fallacy.
3.6-63
1/20/2015
22
Copyright 2013, 2010, 2007, Pearson, Education, Inc.
Example 5: A Syllogism Involving the Word Some
Determine whether the following syllogism is valid or invalid.
All As are Bs.
Some Bs are Cs.
∴ Some As are Cs.
3.6-64
Copyright 2013, 2010, 2007, Pearson, Education, Inc.
Example 6: Fish and Cows
Determine whether the following syllogism is valid or invalid.
No fish are mammals.
All cows are mammals.
∴ No fish are cows.
3.6-65
Copyright 2013, 2010, 2007, Pearson, Education, Inc.
Example 6: Fish and CowsSolution
The first premise tells us that fish and mammals are disjoint sets. The second tells us that the set of cows is a subset of the set of mammals.The conclusion necessarily follows from the premises and the argument is valid.
3.6-66
1/20/2015
23
Copyright 2013, 2010, 2007, Pearson, Education, Inc.
Section 3.7
Switching Circuits
Copyright 2013, 2010, 2007, Pearson, Education, Inc.
Series Circuit
3.7-68
Copyright 2013, 2010, 2007, Pearson, Education, Inc.
Parallel Circuit
3.7-69
1/20/2015
24
Copyright 2013, 2010, 2007, Pearson, Education, Inc.
Example 2: Representing a Switching Circuit with Symbolic Statements
a.Write a symbolic statement that represents the circuit.
3.7-70
Copyright 2013, 2010, 2007, Pearson, Education, Inc.
Example 2: Representing a Switching Circuit with Symbolic Statements
b.Construct a truth table to determine when the light will be on.
3.7-71
Copyright 2013, 2010, 2007, Pearson, Education, Inc.
Example 2: Representing a Switching Circuit with Symbolic Statements Solution
3.7-72
1/20/2015
25
Copyright 2013, 2010, 2007, Pearson, Education, Inc.
Example 3: Representing a Symbolic Statement as a Switching CircuitDraw a switching circuit that represents
[(p ⋀ ~q) ⋁ (r ⋁ q)] ⋀ s.
3.7-73
Copyright 2013, 2010, 2007, Pearson, Education, Inc.
Equivalent Circuits
Equivalent circuits are two circuits
that have equivalent corresponding
symbolic statements.
3.7-74
Copyright 2013, 2010, 2007, Pearson, Education, Inc.
Equivalent Circuits
Sometimes two circuits that look very
different will actually have the exact
same conditions under which the light
will be on.
The truth tables have identical answer
columns.
3.7-75
1/20/2015
26
Copyright 2013, 2010, 2007, Pearson, Education, Inc.
Example 4: Are the Circuits Equivalent?
Determine whether the two circuits are equivalent.
3.7-76
Copyright 2013, 2010, 2007, Pearson, Education, Inc.
Example 4: Are the Circuits Equivalent?
p ⋁ (q ⋀ r)
(p ⋁ q) ⋀ (p ⋁ r)
Solution
3.7-77
Copyright 2013, 2010, 2007, Pearson, Education, Inc.
Example 4: Are the Circuits Equivalent?
The answer columns are identical.
Solution
3.7-78