Foundations of Logic – Quiz 7

Winter term 2021/22, Gregor Hörzer

GROUP NO.

NAMES: Alisa Sulce

1. True or false? Use the truth table method to check whether or not the semantic
consequence relation obtains. (2 x 2 = 4 points)

a. (p  q) ╞ ((p  r)  q)
b. ((p  q)  r) ╞ ((p  r)  (q  r))

2. True or false? Briefly give a reason for your answer. (4 x 1 points = 4 points)

a. If p is a tautology, and q is an arbitrary sentence of Lprop, then p is a semantic

consequence of q.
b. If p is a tautology, and p╞ q, then q is a tautology.
c. If the only premise of an argument is a contradiction, the argument is valid,
no matter whether the conclusion is a tautology, a contradiction, or a
contingent sentence.
d. If the wff  is a contingent sentence, and the wff  is a tautology, the
following argument is valid:   .

3. Sort the sentences below into the smallest possible number N of sets of sentences 1,
…, N such that for each pair of sentences (i, j) within the same set, i ╞ j and j ╞ i.
(2 points)

(1) (p  q) (11) (p  p)

(2) p (12) (p  q)
(3) (p  p) (13) (q  p)
(4) ((p  q)  (q  p)) (14) p
(5) (p  q) (15) (p  (p  q))
(6) (p  q) (16) (p  q)
(7) (p  q) (17) ((p  q)  p)
(8) (p  q) (18) (p  q)
(9) ((p  q)  (p  q)) (19) (p  q)
(10) (p  q) (20) (p  (q  q))

Hand in your answers before Wednesday, December 8, 10 a.m.!

Ex. 1
a.

p q r ( p  q)  ((p  r ) q )

T T T T T T T T T T T T
T T F T T T T T F F T T
T F T T F F T T T T F F
T F F T F F T T F F T F
F T T F T T T F F T T T
F T F F T T T F F F T T
F F T F T F T F F T T F
F F F F T F T F F F T F

Tautology -> true

b.

p q r ((p  q) r )  ( ( p  r )  ( q  r))

T T T T T T T T T T T T T T T T
T T F T T T F F T T F F F T F F
T F T T F F T T T T T T T F T T
T F F T F F T F F T F F F F T F
F T T F F T T T T F T T T T T T
F T F F F T T F F F T F F T F F
F F T F F F T T T F T T T T T T
F F F F F F T F T F T F T F T F

False

Ex.2
a.
p is always true and q can be true or false.
p q q p Therefor q -> p is logically true.
T T T T T > P is a semantic consequence of q. -> true
T F F T T > Theorem A.

b.
q has to be a tautology if p id a tautology and p q is true.
Theorem A.
p p  q
T T T T
T T F F
c.

AU lines of the truth table show therefore it has to be a tautology in each of cases.
p p  q p q p  q Principle of explosion -> true.
F F T F F T T F T F
F F T F F T T F T T

d.
The truth value of  doesn’t matter as  is always true therefore the argument has to
be valid ( only T -> F INVALID ) -> true
    .
p q p  q
T T T T T
F T F T T

Ex. 3
1. TTTF 11. TTFF
2. TTFF 12. TFFF
3. TTFF 13. TFTT
4. TFFT 14. TTFF
5. TTTF 15. TFTT
6. TTTF 16. TFFF
7. TFFF 17. TFFF
8. TFTT 18. TFFT
9. TFFT 19. TFTT
10. TFFT 20. TTFF

1 -> 1, 5, 6
2 -> 2, 3, 11, 14, 20
3 -> 4, 7, 9, 10, 18
4 -> 8, 13, 15, 19
5 -> 12, 16, 17