Logic Manual Exercises Texprep

TexPREP CURRICULUM
PREP I

LOGIC EXERCISES
Darwin E. Peek, Editor

WRITING FACULTY

Manuel P. Barriozábal
Lawrence Williams
Darwin E. Peek
Antonio Garza, Jr.

WRITING SCHOLARS

Johnny Nieves
Joel Palacios
Gabriel Flores

Produced and Distributed by:

TEXAS PREFRESHMAN ENGINEERING PROGRAM (TexPREP)
Manuel P. Berriozábal, Coordinator
The University of Texas at San Antonio
San Antonio, Texas 78249-‐0661

This project was founded by:

National Science Foundation
Instructional Materials Development Program
and
Young Scholars Program

Copyright ©1992
Reproduction permission granted for non-‐commercial purposes only.

LOGIC EXERCISES – MARCH, 1991

SET 1

1. Write each of the following statements in standard form.
a. It is not the case that the fire truck is orange.
___________________________________________________________________
b. It is not the case that a diamond is green.
___________________________________________________________________
c. It is not the case that John is not tall.
___________________________________________________________________
d. It is not the case that Sam is here.
___________________________________________________________________
e. It is not the case that a lion is not a cat.
___________________________________________________________________

2. Write the negation in standard form of each statement in Exercise 1.
~a: ___________________________________________________________________
~b: ___________________________________________________________________
~c: ___________________________________________________________________
~d: ___________________________________________________________________
~e: ___________________________________________________________________

3. Write the negation in standard form for each of the following statements.
Statement: a: Hemmingway was a writer.
Negation: ~a: __________________________________________________________

Statement: b: E.T is an alien.

Negation: ~b: __________________________________________________________

Statement: c: Garfield is a dog.

Negation: ~c: __________________________________________________________

Re-‐typed by Belinda Lopez

1

Statement: d: Snoopy is a cat.
Negation: ~d: __________________________________________________________

Statement: e: A cow is not small.

Negation: ~e: __________________________________________________________

Statement: f: Lassie is not a cat.

Negation: ~f: __________________________________________________________

Statement: g: Santa is skinny.

Negation: ~g: __________________________________________________________

Statement: h: An apple is not blue.

Negation: ~h: __________________________________________________________

4. Give the truth values (True or False) of each statement and its negation in #3.
a __________ b __________ c __________
~a __________ ~b __________ ~c __________

d __________ e __________ f __________

~d __________ ~e __________ ~f __________

g __________ h __________
~g __________ ~h __________

5. Given the statements.
a: Santa is jolly.
b: Snow is white.
c: Christmas is on July 4.
i. Write the conjunction of a and b.
a ∧ b: __________________________________________________________
ii. Write the disjunction of a and c.
a ∨ c: __________________________________________________________
iii. Write the conjunction of ~a and b.
~a ∧ b: _________________________________________________________
iv. Write the disjunction of ~a and ~b.
~a ∨ ~b: ________________________________________________________
2

v. Write the conjunction of ~a and c.
~a ∧ c: _________________________________________________________
vi. Write the disjunction of ~b and ~c.
~b ∨ ~c: ________________________________________________________
vii. Write the conjunction of ~c and ~a.
~c ∧ ~a: ________________________________________________________
viii. Write the disjunction of ~b and ~a.
~b ∨ ~a: ________________________________________________________
ix. Write the conjunction of a and ~c.
a ∧ ~c: _________________________________________________________

6. Write the truth value of each statement in #5.
i. _________________ iv. _________________ vii. _______________
ii. ________________ v. _________________ viii. ______________
iii. ________________ vi. _________________ ix. _______________

7. Complete the following truth table.
p q p ∧ ~q
T T
T F
F T
F F

8. Complete the following truth tables.
p q p ∨ ~q ~p ∨ q ~(p ∧ q) p ∨ ~p p ∧ ~p
T T
T F
F T
F F

Is p ∨ ~q ≡ ~(p ∧ q)? Give a brief explanation for your answer.

3

9. Construct a truth table for ~p ∧ ~q and ~(p ∨ q).
p q ~p ∧ ~q ~(p ∨ q)

Are ~p ∧ ~q and ~(p ∨ q) logically equivalent?
Give a brief explanation for your answer.

10. Construct truth tables for: p ∧ ~q, ~p ∨ q, ~(p ∧ q), ~p ∨ ~q.
p q p ∧ ~q ~p ∨ q ~(p ∧ q) ~p ∨ ~q

a. Match up the logically equivalent statements.

b. Match up the statements which are negations of one another.

11. Define the compound statement p ∨ q thus:
p ∨ q ≡ (p ∨ q) ∧ ~(p ∧ q).

Construct a truth table for p ∨ q.
p q p ∨ q p ∧ q ~(p ∧ q) (p ∨ q) ∧ ~(p ∧ q) p ∨ q


4

12. Complete the truth tables below.
p q r (p ∧ q) ∧ r p ∧ (q ∧ r) (p ∨ q) ∨ r p ∨ (q ∨ r)
T T T
T T F
T F T
T F F
F T T
F T F
F F T
F F F

Match up the statements which are logically equivalent.

13. Construct truth tables for:

(p ∨ q) ∧ r, p ∨ (q ∧ r), (p ∧ q) ∨ r, (p ∧ r) ∨ (q ∧ r).

Match up the statements which are logically equivalent.

14. Prove: (p ∧ q) ∨ r ≡ (p ∨ r) ∧ (q ∨ r).

5

15. Prove: [(~p ∨ q) ∧ p] ∨ q ≡ q.

16. Prove: [(~p ∨ q) ∧ ~q] ∨ ~p ≡ ~p.

17. Prove: (p ∧ q) ∨ q ≡ q.

18. Prove: (p ∨ q) ∧ p ≡ p.

19. Prove: p ∨ q ≡ (p ∨ q) ∨ p.


6

20. Prove: ~(p ∨ q) ≡ ~p ∧ ~q.

21. Prove: ~(p ∧ q) ≡ ~p ∨ ~q.

22. Construct a truth table for p → ~q.

23. Prove: p → q ≡ ~q → ~p.


7

p: Santa is jolly.
q: Snow is white.
r: Christmas is not on July 4.
a. Write in standard form the negation of the conjunction of p and q.

b. Write in standard form the negation of the disjunction of p and q.

c. Write in standard form the negation of the conjunction of p and r.

d. Write in standard form the negation of the disjunction of p and r.

e. Write in standard form the negation of the conjunction of q and r.

f. Write in standard form the negation of the disjunction of q and r.

p: Summer is hot.
q: The pool is cool.
a. Write the conditional statement with p as antecedent and q as consequent.

b. Write the converse of the statement in 25a.

8

c. Write the inverse of the statement in 25a.

d. Write the contrapositive of the statement in 25a.

e. Write out ~p ∨ q.

f. Write out p ∧ ~q.

26. Prove: p → q ≡ ~p ∨ q.

27. Prove: ~(p → q) ≡ p ∧ ~q.


9

28. Write the conditional statements in #25 a, b, c, d as logically equivalent
disjunctions.
a. ___________________________________________________________________
b. ___________________________________________________________________
c. ___________________________________________________________________
d. ___________________________________________________________________

29. Write in standard form the negations of the conditional statements in #25 a,b,c,d.

a. ___________________________________________________________________
b. ___________________________________________________________________
c. ___________________________________________________________________
d. ___________________________________________________________________

30. Prove: p → q is not logically equivalent to q → p.

31. Prove: ~(p → q) is not logically equivalent to ~p → q.


10

32. Construct truth tables for p → (q → r) and (p ∧ q) → r.

Are these statements logically equivalent?

33. Prove: p → (q → r) is not logically equivalent to (p → q) → r.

34. Prove: p → p is a tautology.

35. Prove: [(p → q) ∧ p] → q is a tautology.


11

36. Prove: [(p → q) ∧ ~q] → ~p is a tautology.

37. Prove: [(p → q) ∧ ~p] → ~q is not a tautology.

38. Prove: [(p → q) ∧ q] → p is not a tautology.

39. Prove: For any statement p, p ⇒ p.

40. Prove: If p ⇒ q and q ⇒ r, then p ⇒ r.


12

41. Prove: [(p → q) ∧ p] ⇒ q.

42. Prove: [(p → q) ∧ ~q] ⇒ ~p.

43. Prove: [(p → q) ∧ q] ⇒ p.

44. Prove: [(p → q) ∧ ~p] ⇒ ~q.

45. Test the validity of each of the following arguments:

a. P1: p → q b. c. d.
P1: p → q P1: p → q P1: p ∨ q
P2: q
P2: ~p P2: r → p P2: p ∨ ~q
C: p
C: ~q P2: q → r C: p
C: p

*Write your answers in a separate sheet of paper.

13

In Exercises 46-‐50, Rewrite Each Argument in Symbolic Form Using the Suggested
Letters. Then Check the Validity of Each Argument.

46. Carlos has been paid (c) or Sam is spending more than he can afford (s). If Sam is
spending more than he can afford, then his bank account is empty (e). But,
Sam’s bank account is not empty. Therefore, Carlos has been paid.

47. If it rains (r), then the train is late (l). It is not raining. Therefore, the train is not
late.

48. Al is a great ballplayer (a). If Al is a great ballplayer and Bob is a catcher (b), then
Carlos is the designated hitter (c). But, Carlos is not the designated hitter.
Therefore, Bob is not a catcher.

49. If I do not study (d), then I will sleep (l). I will not sleep if I am worried (w).
Therefore, if I am worried, then I will study.

14

50. Logic is difficult (l) or not many students like it (s). If mathematics is easy (m),
then logic is not difficult. Therefore, if many students like logic, then
mathematics is not easy.

Test the Validity of the Following:
51. If Mike rides the bus to UTSA, then Abel will drive his car. Mike rides the bus or
Benny will walk to UTSA. Abel will not drive his car. Therefore, Benny will walk
to school.

52. The car is blue or it is old and green. If it is old, then it needs to be inspected and
repaired. It need not be inspected. Therefore, the car is blue.

53. If the witness is telling the truth, then Mark has an alibi. The witness is telling
the truth or there is a conspiracy. If there is a conspiracy, then Albert is involved.
Therefore, if Mark does not have an alibi, then Albert is involved.

15

54. Prove that the following argument is valid.

P1: (p ∨ q) → r
P2: r → (s ∨ t)

P3: t → w
P4: ~s ∧ ~w
C: ~p ∧ ~q

55. Horace, Gladstone and Klunker are suspected of embezzling company funds.
They are questioned by the police and testify as follows:
Horace: “Gladstone is guilty and Klunker is innocent.”
Gladstone: “If Horace is guilty, then so is Klunker.”
Klunker: “I’m innocent, but at least one of the others is guilty.”
a. Assuming everyone is innocent, who lied?
b. Assuming everyone told the truth, who is innocent and who is guilty?
c. Assuming that the innocent told the truth and the guilty lied, who is innocent
and who is guilty?
Hint:
Let h denote “Horace is innocent.”
Let g denote “Gladstone is innocent”
Let k denote “Klunker is innocent”

Now symbolize all three testimonies and make one single truth table with a
column for each testimony. (If you need more space, use a separate paper.)

16

SET 2
Given the statements.
p: White is Governor.
q: Wing is Councilman.

1. Write the conjunction of p and q.
2. Write the disjunction of p and q.
3. Write (a) the negation of p and (b) the negation of q.
4. Write the conditional statement with p as hypothesis and q as conclusion.
5. Write the converse of the statement in #4.
6. Write the contrapositive of the statement in #4.
7. Write the inverse of the statement in #4.

8. Construct a truth table for (p → q) → r.

9. Construct a truth table for (p ∧ q) → r.
10. Prove that ~p ∨ q and p → q are logically equivalent.
11. Write the negation of the statement in #1.
13. Write the negation of the conditional statement in #4.
17. Write the statement in #4 as a logically equivalent disjunction.
18. Write the negation of each statement in #3.
22. Write the statement in #2 as a logically equivalent conditional statement.
23. Prove:
a. p ∨ (q ∧ r) ≡ (p ∨ q) ∧ (p ∨ r).
b. p ∧ (q ∨ r) ≡ (p ∧ q) ∨ (p ∧ r).
24. Prove: ~(p ∨ q) ≡ ~p ∧ ~q.
25. Prove: ~(p ∧ q) ≡ ~p ∨ ~q.
26. Given the conditional statement p → (q → r). Write its negation.

17

ELEMENTARY SET THEORY EXERCISES

1. Let X = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10},
A = {1, 4, 7}
B = {1, 2, 3, 6, 7} and
C = {3, 6, 7, 8, 9}.

Find:
a. A ∩ B g. B -‐ C

b. A ∪ C h. C (B – C)

c. B – C i. CA ∩ CB

d. A ∪ (B ∩ C) j. CA ∪ CB

e. A ∩ (B ∩ C) k. (A ∪ B) ∩ (A ∪ C)

f. A ∩ (B ∪ C) l. CA ∩ B


18

2. Let P(X) be the set of all subsets of X. P(X) is called the power set of X.
For example, if X = {1, 2}, then P(X) = {∅, {1}, {2}, X}.
a. Let X = {1, 2, 3}. List the elements of P(X).

b. Let X = {1, 2, 3, 4}. List the elements of P(X).

c. Let X be the set of Exercise 1.

(i) Let H(X) = {A ⊂ X⏐the sum of the distinct elements of A is 15}.
List the elements of H(X).
Note: H(X) ⊂ P(X).

(ii) Let K(X) = {A ⊂ X⏐the sum of the distinct elements of A is 50}.
List the elements of K(X).

(iii) Let G(X) = {A ⊂ X⏐the sum of the distinct elements of A is 55}.
List the elements of G(X).


19

In Exercises 3 thru 14, let A, B and C be the arbitrary subsets of a fixed set X.
3. Prove: A ∩ B = B ∩ A.

4. Prove: A ∩ (B ∩ C) = (A ∩ B) ∩ C.

5. Prove: If A ⊂ B, then A ∩ B = A.

6. Prove: If A ∩ B = A, then A ⊂ B.


20

7. Prove: A ∪ B = B ∪ A.

8. Prove: A ∪ (B ∪ C) = (A ∪ B) ∪ C.

9. Prove: If A ⊂ B, then A ∪ B = B.

10. Prove: If A ∪ B = B, then A ⊂ B.


21

11. Prove: A ∪ (B ∩ C) = (A ∪ B) ∩ (A ∪ C).

12. Prove: A ∩ (B ∪ C) = (A ∩ B) ∪ (A ∩ C).

13. Prove: C(A ∪ B) = CA ∩ CB.

14. Prove: C(A ∩ B) = CA ∪ CB.


22

15. In a survey of 300 San Antonians, 130 claimed they read the News and 150 the
Light. Sixty said they read both the Express and the news while 50 read only the
Express, 30 read only the News, 60 read only the Light and 20 read all three.
a. How many read both the Express and the News but not the Light?
b. How many read both the News and the Light but not the Express?
c. How many read both the Express and the Light?
d. How many read none of the papers?
e. How many read the Express?

16. Five hundred San Antonians were asked to reveal their restaurant preferences:
190 liked McDonald’s
170 liked Luby’s
50 Liked both Luby’s and McDonald’s
90 liked both Luby’s and Mi Tierra.
100 liked only Mi Tierra.
70 liked only McDonald’s
60 Liked both Luby’s and Mi Tierra but not McDonald’s
a. How many liked all three restaurants?
b. How many liked only Luby’s?
c. How many liked both Mi Tierra and McDonald’s but not Luby’s?
d. How many liked Mi Tierra?
e. How many liked none of the restaurants?


23

17. A magazine vendor noted the following sales statistics in a given week:
150 customers purchased Time.
200 customers purchased Newsweek.
50 customers purchased all three.
400 customers purchased none of these magazines.
30 customers purchased Time but none of the others.
40 customers purchased Consumer Reports but none of the others.
60 purchased both Consumer Reports and Newsweek but not Time.
20 purchased both Consumer Reports and Time but not Newsweek.
a. How many customers purchased only Newsweek?
b. How many customers purchased both Newsweek and Consumer Reports
but not Time?
c. How many purchased either Time or Newsweek but not both?
d. How many customers did the vendor have during the week?

18. The results of a questionnaire sent to all the alumni of a certain university
showed that 66 percent expected to attend the forthcoming activities
celebrating the 150th anniversary of the school’s founding. On the day of the
festivities, it was learned that 90 percent of those who actually did attend had
previously so indicated, while 30 percent of those who did not attend had
previously indicated that they expected to attend. Determine
(a) What percent of the total alumni attended, and
(b) what percent of the total alumni acted differently than they had first
indicated.
Hint: For simplicity, assume that the total number of alumni is 100.


24

SWITCHING NETWORKS EXERCISES

1. Construct a network statement for each of the following network diagrams.
a.

S1 S1 S1

S2 S2 S2

b.

S1 S1

S1 S2 S2

S1 S2 S3 S3

c.

S1

S2
S1 S1
S3 S2
S3

S3

S2

S1
S3
25

d.
S1

S1
S2

e.

S2

S3

2. In Exercise 1, answer the following questions with a brief justification.
a. Are “a” and “b” electrically equivalent?
b. Are “a” and “c” electrically equivalent?
c. Are “a” and “d” electrically equivalent?
d. Are “a” and “e” electrically equivalent?
e. Are “b” and “c” electrically equivalent?
f. Are “b” and “d” electrically equivalent?
g. Are “b” and “e” electrically equivalent?
h. Are “c” and “d” electrically equivalent?
i. Are “c” and “e” electrically equivalent?
j. Are “d” and “e” electrically equivalent?

3. Construct a network diagram for each of the following network statements.
(Use a separate sheet of paper for your answers.)
a. S1 (S1 S2) (S1 S2 S3) (S1 S2 S3)
b. (S1 S2) (S1 S3) (S2 S3)
c. [S1 (S2 S3)] [S1 (S2 S3)] (S1 S2)
d. [S1 S2 S3] [S1 S2 S3] [S1 S2]

26

4. For each of the network diagrams in Exercise 3, construct a simpler network
diagram.

5. For each of the network diagrams in Exercise 4, construct a network statement.

6. Construct a network statement for each of the following:
a.

S2

S1 S2
S1 S2

b.
S1
S1

S2

S2

S1 S1

S2

7. Write the state tables for the above network diagrams using “1” for closed and
“0” for open, and let B represent the state of the network.

27

8. For each of the network diagrams in Exercise 6, construct a simpler network
diagram.

9. For each of the following states, construct a network diagram with two (2)
switches which will satisfy (i.e., meet) the conditions:
a. The network will be open when both switches are closed.

b. The network will be open when both switches are open.

c. The network will be closed when and only when one switch is closed.

10. Construct a network diagram for each of the following network statements.
a. [S1 (S1 S2)] [S1 S2 S1]
b. S1 (S1 S3) (S2 S2)
c. S1 (S2 S3) (S1 S2)

11. Construct a single network diagram with two (2) switches which will satisfy all
the following conditions:
(i) The network will be closed when both switches are closed.

(ii) The network will be closed when both switches are open.

28

(iii) The network will be open when and only when one switch is closed.

12. Construct a network diagram with two (2) switches which satisfies the following
state table, where B is the state of the network.
S1 S2 B
0 0 1
1 0 1
0 1 0
1 1 0
Construct a network diagram with one (1) switch which satisfies the above state
table.

13. Will the following network ever be closed? Why?
S1

S1
S2 S1 S2

S2

S1 S2 S1

S1
S1

S1

S1
29

14. Are the following two networks electrically equivalent? Why?
a. S 1 S 2

S1 S2 S1

S1 S2

S2
b.

S1 S2

S1 S2

S1 S2 S1

S1 S2 S2
S1 S1
15. Construct a single network diagram with four (4) switches, S1, S2, S3 and S4, which
will satisfy all the following conditions:
(i) The network will be closed when and only when one of the three
switches, S1, S2 or S3, is closed provided that S4 is also closed.

(ii) The network will be open when S4 is open regardless of the states of S1,
S2 or S3.

(iii) The network will be open when two or more of the three switches, S1, S2,
S3, are closed.

(iv) The network will be open when all three switches, S1, S2, S3, are open.

30

≡ ∀ ∃ x ∍ ∴ ↔ → ≡ ∩ ∪ ⊃
⊇ ⊄ ⊂ ⊆ ∈ ∉ ∧ ∨ ⇒ ⏐ ∅
≠ Ø ≤ ≥

http://people.hofstra.edu/Stefan_Waner/realWorld/logic/logicintro.html


31

Logic Manual Exercises Texprep

Uploaded by

Copyright:

Available Formats

Logic Manual Exercises Texprep

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Logic Manual Exercises Texprep

Uploaded by

Copyright:

Available Formats

What is the purpose of the document?

What is the purpose of the document?

What topics are covered in the exercises?

What topics are covered in the exercises?

LOGIC EXERCISES – MARCH, 1991

Statement: b: E.T is an alien.

Statement: c: Garfield is a dog.

Re-­‐typed by Belinda Lopez

Statement: e: A cow is not small.

Statement: f: Lassie is not a cat.

Statement: g: Santa is skinny.

Statement: h: An apple is not blue.

d __________ e __________ f __________

ii. ________________ v. _________________ viii. ______________

iii. ________________ vi. _________________ ix. _______________

Re-­‐typed by Belinda Lopez

Re-­‐typed by Belinda Lopez

Re-­‐typed by Belinda Lopez

Re-­‐typed by Belinda Lopez

Re-­‐typed by Belinda Lopez

Re-­‐typed by Belinda Lopez

Re-­‐typed by Belinda Lopez

Re-­‐typed by Belinda Lopez

8. Construct a truth table for (p → q) → r.

Re-­‐typed by Belinda Lopez

Re-­‐typed by Belinda Lopez

Re-­‐typed by Belinda Lopez

Re-­‐typed by Belinda Lopez

Re-­‐typed by Belinda Lopez

Re-­‐typed by Belinda Lopez

Re-­‐typed by Belinda Lopez

Re-­‐typed by Belinda Lopez

Re-­‐typed by Belinda Lopez

You might also like

Re-‐typed by Belinda Lopez

d e f __

ii. ________ v. _ viii. ______

iii. ________ vi. _ ix. _______

Re-‐typed by Belinda Lopez

Re-‐typed by Belinda Lopez

Re-‐typed by Belinda Lopez

Re-‐typed by Belinda Lopez

Re-‐typed by Belinda Lopez

Re-‐typed by Belinda Lopez

Re-‐typed by Belinda Lopez

Re-‐typed by Belinda Lopez

Re-‐typed by Belinda Lopez

Re-‐typed by Belinda Lopez

Re-‐typed by Belinda Lopez

Re-‐typed by Belinda Lopez

Re-‐typed by Belinda Lopez

Re-‐typed by Belinda Lopez

Re-‐typed by Belinda Lopez

Re-‐typed by Belinda Lopez

Re-‐typed by Belinda Lopez