Logical Arguments 1
Logical Arguments 1
E.1
Introduction to Logic
Introduction to Logic
Statements Truth Tables
Statements
In everyday speech and in mathematics you make inferences that adhere to
common laws of logic. These methods of reasoning allow you to build an algebra of statements by using logical operations to form compound statements from
simpler ones. A primary goal of logic is to determine the truth value (true or false)
of a compound statement knowing the truth value of its simpler components. For
instance, the compound statement The temperature is below freezing and it is
snowing is true only if both component statements are true.
Definition of a Statement
1. A statement is a sentence to which only one truth value (either true or false) can be meaningfully assigned.
2. An open statement is a sentence that contains one or more variables and becomes a statement when each
variable is replaced by a specific item from a designated set.
Statement
A square is a rectangle.
3 is less than 5.
Truth Value
T
F
Nonstatement
Do your homework.
Did you call the police?
Truth Value
No truth value can be meaningfully assigned.
No truth value can be meaningfully assigned.
Open Statement
x is an irrational number.
She is a computer science
major.
Truth Value
We need a value of x.
We need a specific person.
E2
if p is true, q is true, or both p and q are true. The following list summarizes the
terms and symbols used with these three operations of logic.
Operations of Logic
Operation
Verbal Statement
Symbolic Form
Name of Operation
~
not p
p and q
p or q
~p
pq
pq
Negation
Conjunction
Disjunction
Compound statements can be formed using more than one logical operation,
as demonstrated in Example 2.
(b) ~p
(c) ~ p q
(d) ~p ~q
Solution
(a)
(b)
(c)
(d)
APPENDIX E
E3
Introduction to Logic
Truth Tables
To determine the truth value of a compound statement, you can create charts
called truth tables. These tables represent the three basic logical operations.
Negation
Conjunction
Disjunction
~p
~q
pq
pq
For the sake of uniformity, all truth tables with two component statements will
have T and F values for p and q assigned in the order shown in the first two
columns of each of these three tables. Truth tables for several operations can be
combined into one chart by using the same two first columns. For each operation,
a new column is added. Such an arrangement is especially useful with compound
statements that involve more than one logical operation and for showing that two
statements are logically equivalent.
Logical Equivalence
Two compound statements are logically equivalent if they have identical truth tables. Symbolically, we denote
the equivalence of the statements p and q by writing p q.
Use a truth table to show the logical equivalence of the statements ~p ~q and
~ p q.
Solution
~p
~q
~p ~q
pq
~ p q
Identical
Because the fifth and seventh columns in the table are identical, the two given
statements are logically equivalent.
E4
DeMorgans Laws
p ~ p is a tautology
~p
p ~p
1. ~ p q ~p ~q
2. ~ p q ~p ~q
Compound statements that are true, no matter what the truth values of
component statements, are called tautologies. One simple example is the
statement p or not p, as shown in the table at the left.
Exercises
E.1
1.
3.
5.
7.
9.
10.
11.
12.
(a) ~p
2.
4.
6.
8.
Open Statement
x2 5x 6 0
x2 x 6 0
x2 4
x3 4
4 x 2
x2 x
x
19. 1
x
3 x 2
20.
13.
14.
15.
16.
17.
18.
Values of x
(a)
(a)
(a)
(a)
(a)
(a)
x2
x2
x 2
x 1
x0
x3
(b)
(b)
(b)
(b)
(b)
(b)
x 2
x 2
x0
x7
x1
x 3
(a) x 4
(b) x 0
(a) x 8
(b) x 8
21. p:
q:
23. p:
q:
24. p:
q:
(b) ~q
(c) p q
(d) p q
25. p:
q:
26. p:
q:
27. p:
q:
28. p:
q:
(b) ~p q
(c) p ~q
(d) p ~q
APPENDIX E
29.
30.
31.
32.
33. The dog does not have fleas or the dog is not
scratching.
34. The dog has fleas and the dog is scratching.
35. The dog does not have fleas and the dog is scratching.
36. The dog has fleas or the dog is not scratching.
In Exercises 3742, write the negation of the given
statement.
37.
38.
39.
40.
41.
42.
43. ~p q
45. ~p ~q
47. p ~q
44. ~p q
46. ~p ~q
48. p ~q
Introduction to Logic
E5
49.
50.
51.
52.
53.
54.
~p q, p ~q
~ p ~q, ~p q
~ p ~q, ~p q
~ p q, ~p ~q
p ~q, ~ ~p q
p ~q, ~ ~p q
55. (a)
(b)
56. (a)
(b)
57. (a)
59.
60.
61.
62.
~p p
~p p
~ ~p ~p
~ ~p ~p