Scribd
Upload
591 views39 pages

Logic 2

This document covers logic statements and quantifiers, truth tables, equivalent statements, tautologies, and contradictions. It includes examples of constructing truth tables, determining if statements are equivalent, and identifying tautologies and contradictions. Example problems are worked through step-by-step and include truth tables to verify solutions. Key concepts like De Morgan's Laws and the use of symbols are explained.

Uploaded by

Kim Abigelle Garcia
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
591 views39 pages

Logic 2

This document covers logic statements and quantifiers, truth tables, equivalent statements, tautologies, and contradictions. It includes examples of constructing truth tables, determining if statements are equivalent, and identifying tautologies and contradictions. Example problems are worked through step-by-step and include truth tables to verify solutions. Key concepts like De Morgan's Laws and the use of symbols are explained.

Uploaded by

Kim Abigelle Garcia
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 39

Logic

Chapter 3
Logic
Chapter 3

Section 3.1: Logic Statements and Quantifiers


Section 3.2: Truth Tables, Equivalent Statements
and Tautologies
Section 3.3: The Conditional and Biconditional
Section 3.4: The Conditional and Related
Statements
Constructing
Truth Tables
If the given statement involves
only two simple statements,
then start with a table with
four rows called the standard
truth table form.
Refer to the table on the left.
Example 1: Truth Tables

1. Construct a table for ~(~p v q) v q.


2. Use the truth table from part 1 to determine the
truth value of ~(~p v q) v q, given that p is true and
q is false.
Solution to the Example 1 (#1):
1. Start with the standard truth table form and then
include a ~p column.
Solution to the Example 1 (#1):
Now use the truth values from the ~p and q
columns to produce the truth values for ~p v q, as
shown in the rightmost column of the following
table.
Solution to the Example 1 (#1):
Negate the truth values in the ~p v q column to
produce the following.
Solution to the Example 1 (#1):
As our last step, we form the disjunction of
~(~p v q) with q and place the results in the
rightmost column of the table. See the following
table. The shaded column is the truth table for
~(~p v q) v q.
Solution to the Example 1 (#2):
In row 2 of the truth table, we see that
when p is true, and q is false, the statement
~(~p v q) v q in the rightmost column is true.
More Examples: Truth Tables
Compound statements that
involve exactly three simple
statements require a standard
truth table form with 2³ = 8
rows.
Refer to the table on the left.
Example 2: Truth Tables

1. Construct a table for (p ^ q) ^ (~r v q).


2. Use the truth table from part 1 to determine the
truth value of (p ^ q) ^ (~r v q), given that p is true,
q is true and r is false.
Solution to the Example 2 (#1):
1. Using the procedures developed in Example 1, we can produce the following truth table.
The shaded column is the truth table for (p ^ q) ^ (~r v q). The numbers in the squares
below the columns denote the order in which the columns were constructed. Each truth
value in the column numbered 4 is the conjunction of the truth values to its left in the
columns numbered 1 and 3.
Solution to the Example 2 (#2):
In row 2 of the constructed truth table, we see that
(p ^ q) ^ (~r v q) is true when p is true, q is true and r is
false.
More Examples: Truth Tables
Constructing
Truth Tables
(The Alternative Method)
For Example 3, we will use an
alternative procedure to
construct a truth table.

Refer to the table on the left.


Example 3: Use the Alternative Method to Construct a Truth Table

1. Construct a table for p v [ ~(p ^ ~q) ].


Solution to the Example 3:

Step 1: The given statement p v [ ~(p ^ ~q) ] has


the two simple statements p and q. Thus we start
with a standard form that has 2² = 4 rows.
Solution to the Example 3:

In each column, enter the truth values for the statements p and ~q, as
shown in the columns numbered 1, 2, and 3 of the following table.
Solution to the Example 3:
Step 2: Use the truth values in columns 2 and 3 to determine the
truth values to enter under the “and” connective. See column 4 in the
following truth table. Now negate the truth values in column 4 to
produce the truth values in column 5.
Solution to the Example 3:
Step 2: Use the truth values in the columns 1 and 5 to determine the
truth values to enter under the “or” connective. See column 6 in the
following table. Shaded column 6 is the truth table for
p v [ ~(p ^ ~q) ].
More Example: Truth Tables
EQUIVALENT
STATEMENTS
__________________________________

Two statements are equivalent if they both have the


same truth value for all possible truth values of their
simple statements.

The notation p ≡ q is used to indicate that the


statements p and q are equivalent.
Example 4: Verify that two statements are Equivalent

1. Show that ~(p v ~q) and ~p ^ q are equivalent


statements.
Solution to the Example 4:
Construct two truth tables and compare the results. The truth
tables below show that ~(p v ~q) and ~p ^ q have the same truth
values for all possible truth values of their simple statements. Thus
the statements are equivalent.
More Example: Equivalent Statements
These equivalences are known
as De Morgan’s laws for
statements.
De Morgan’s laws can be used
to restate certain English
sentences in an equivalent
form.

Refer to the table on the left.


Example 5: State an Equivalent Form

1. Use one of De Morgan’s laws to restate the


following sentence in an equivalent form.
"It is not true that, I graduated or I got a job."
Solution to the Example 5:
Let p represent the statement “I graduated.”
Let q represent the statement “I got a job.”
In symbolic form, the original sentence is ~(p v q).
One of De Morgan’s laws states that this is equivalent to ~p ^ ~q.

Thus a sentence that is equivalent to the original sentence is


“I did not graduate and I did not get a job.”
More Example: De Morgan's Laws
Tautologies
and
Contradictions
TAUTOLOGY
__________________________________

A tautology is a statement that is always true.


CONTRADICTION
__________________________________

A contradiction is a statement that is always false.


Example 6: Verify Tautologies and Contradictions

1. Show that p v (~p v q) is a tautology.


Solution to the Example 6:

Enter the truth values for each simple statement and its negation as
shown in the columns numbered 1, 2, and 3.

Use the truth values in columns 2 and 3 to determine the truth


values to enter in column 4, under the “or” connective.

Use the truth values in columns 1 and 4 to determine the truth


values to enter in column 5, under the “or” connective.
Solution to the Example 6:

Column 5 of the table shows that p v (~p v q) is always true.


Therefore, p v (~p v q) is a tautology.
More Example: Tautology and Contradiction

You might also like