Scribd
Upload
122 views

Lecture 7-2 - Logic - Truth Tables and Equivalent Statements

The document discusses logic statements and their truth values using truth tables. It covers conjunctions, disjunctions, negations and equivalent statements. De Morgan's laws are also introduced.

Uploaded by

misssunshine112
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
122 views

Lecture 7-2 - Logic - Truth Tables and Equivalent Statements

The document discusses logic statements and their truth values using truth tables. It covers conjunctions, disjunctions, negations and equivalent statements. De Morgan's laws are also introduced.

Uploaded by

misssunshine112
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 20

Chapter 3

Introduction
to Logic

© 2008 Pearson Addison-Wesley.


All rights reserved
Chapter 3: Introduction to Logic

3.1 Statements and Quantifiers


3.2 Truth Tables and Equivalent Statements
3.3 The Conditional and Circuits
3.4 More on the Conditional
3.5 Analyzing Arguments with Euler Diagrams
3.6 Analyzing Arguments with Truth Tables

© 2008 Pearson Addison-Wesley. All rights reserved 3-2-2


Chapter 1

Section 3-2
Truth Tables and Equivalent
Statements

© 2008 Pearson Addison-Wesley. All rights reserved 3-2-3


Truth Tables and Equivalent
Statements
• Conjunctions
• Disjunctions
• Negations
• Mathematical Statements
• Truth Tables
• Alternative Method for Constructing Truth
Tables
• Equivalent Statements and De Morgan’s Laws
© 2008 Pearson Addison-Wesley. All rights reserved 3-2-4
Conjunctions

The truth values of component statements


are used to find the truth values of
compound statements.

The truth values of the conjunction p and q,


symbolized p ∧ q are given in the truth
table on the next slide. The connective and
implies “both.”

© 2008 Pearson Addison-Wesley. All rights reserved 3-2-5


Conjunction Truth Table

p and q
p q p∧q
T T T
T F F
F T F
F F F

© 2008 Pearson Addison-Wesley. All rights reserved 3-2-6


Example: Finding the Truth Value of
a Conjunction
Let p represent the statement 4 > 1, q represent
the statement 12 < 9 find the truth of p ∧ q.

Solution
False, since q is false.

© 2008 Pearson Addison-Wesley. All rights reserved 3-2-7


Disjunctions

The truth values of the disjunction p or q,


symbolized p ∨ q are given in the truth
table on the next slide. The connective or
implies “either.”

© 2008 Pearson Addison-Wesley. All rights reserved 3-2-8


Disjunctions

p or q
p q p∨q
T T T
T F T
F T T
F F F

© 2008 Pearson Addison-Wesley. All rights reserved 3-2-9


Example: Finding the Truth Value of
a Disjunction
Let p represent the statement 4 > 1, q represent
the statement 12 < 9 find the truth of p ∨ q.

Solution
True, since p is true.

© 2008 Pearson Addison-Wesley. All rights reserved 3-2-10


Negation

The truth values of the negation of p,


symbolized p , are given in the truth table
below.
not p
p p
T F
F T

© 2008 Pearson Addison-Wesley. All rights reserved 3-2-11


Example: Mathematical Statements

Let p represent the statement 4 > 1, q represent


the statement 12 < 9, and r represent 0 < 1.
Decide whether each statement is true or false.
a) p∧ q
b) ( p ∧ r ) ∨ ( q ∧ p)
Solution
a) False, since ~ p is false.
b) True

© 2008 Pearson Addison-Wesley. All rights reserved 3-2-12


Truth Tables

Use the following standard format for listing the


possible truth values in compound statements
involving two component statements.
p q Compound Statement
T T
T F
F T
F F
© 2008 Pearson Addison-Wesley. All rights reserved 3-2-13
Example: Constructing a Truth Table

Construct the truth table for p ∧ ( p∨ q ).


Solution
p q ~p ~q p∨ q p∧( p∨ q)
T T F F F F
T F F T T T
F T T F T F
F F T T T F

© 2008 Pearson Addison-Wesley. All rights reserved 3-2-14


Number of Rows in a Truth Table

A logical statement having n component


statements will have 2n rows in its truth table.

© 2008 Pearson Addison-Wesley. All rights reserved 3-2-15


Alternative Method for Constructing Truth
Tables

After making several truth tables, some


people prefer a shortcut method where not
every step is written out.

© 2008 Pearson Addison-Wesley. All rights reserved 3-2-16


Equivalent Statements

Two statements are equivalent if they have the


same truth value in every possible situation.

© 2008 Pearson Addison-Wesley. All rights reserved 3-2-17


Example: Equivalent Statements

Are the following statements equivalent?


p∧ q and ( p ∨ q)
Solution
Yes, see the tables below.
p q p∧ q ( p ∨ q)
T T F F
T F F F
F T F F
F F T T
© 2008 Pearson Addison-Wesley. All rights reserved 3-2-18
De Morgan’s Laws

For any statements p and q,


( p ∨ q) ≡ p∧ q and
( p ∧ q) ≡ p∨ q.

© 2008 Pearson Addison-Wesley. All rights reserved 3-2-19


Example: Applying De Morgan’s
Laws

Find a negation of each statement by applying


De Morgan’s Law.
a) I made an A or I made a B.
b) She won’t try and he will succeed.

Solution
a) I didn’t make an A and I didn’t make a B.
b) She will try or he won’t succeed.

© 2008 Pearson Addison-Wesley. All rights reserved 3-2-20

You might also like