0% found this document useful (0 votes)
190 views24 pages

Unit 4 2010 Answers

The document discusses truth tables and logic sentences. It provides examples of constructing truth tables to determine if sentences are tautologies, contradictions, or contingent. It also gives examples of checking if arguments are valid and sentences are equivalent or consistent.

Uploaded by

alicenuoli
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
0% found this document useful (0 votes)
190 views24 pages

Unit 4 2010 Answers

The document discusses truth tables and logic sentences. It provides examples of constructing truth tables to determine if sentences are tautologies, contradictions, or contingent. It also gives examples of checking if arguments are valid and sentences are equivalent or consistent.

Uploaded by

alicenuoli
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/ 24

Logic Unit 4: Semantics

Niko Scharer
1
UNIT 4
SEMANTICS: FUN WITH TRUTH-TABLES

4.3 EG1 ~R S


R S ~ R S
T T F T T T
T F F T F F
F T T F T T
F F T F T F
A contingent sentence.

~(R S)

R S ~ ( R S )
T T F T T T
T F F T T F
F T F F T T
F F T F F F
A contingent sentence.


4.3 EG2

Lets do a truth-table for the sentence: (Q ~R) ~ (P Q)
Since there are 3 atomic sentences, there will be 2
3
possible TVAs. Thats 8 rows.
Truth-table for: ( Q ~ R ) ~ (P Q )
* *
P Q R ( Q ~ R) ~ ( P Q )
T T T T T F T F F T T T
T T F T T T F F F T T T
T F T F F F T F T T F F
T F F F T T F T T T F F
F T T T T F T F F F T T
F T F T T T F F F F T T
F F T F F F T F F F T F
F F F F T T F F F F T F
Not a contradiction. Its contingent, as we can see from the fourth row.
Logic Unit 4: Semantics
Niko Scharer
2
4.4 EG1: Lets try it out.

Are the following sentences tautologous, contradictory or contingent?
a) ~P Q ( P Q ) : removed parentheses for informal notation
TAUTOLOGY
* *
P Q ( ~ P Q ) (P Q )
T T F T T T T T T T
T F F T F F T T F F
F T T F T T T F T T
F F T F T F T F T F

b) ~ ( ~ P ~ Q) (Q ~ P)

CONTRADICTION
* *
P Q ~ ( ~ P ~ Q ) ( Q ~ P )
T T T F T F F T F T F F T
T F F F T T T F F F T F T
F T F T F T F T F T T T F
F F F T F T T F F F T T F


c) ~ (P (P Q)) Contingent.


P Q ~ ( P ( P Q ))
T T F T T T T T
T F T T F T F F
F T T F F F T T
F F T F F F T F

4.4 EG2
a) Are these sentences equivalent? YES.
( P ~Q) ( Q P )


P Q (P ~ Q) (Q P)
T T T T F T T T T
T F T T T F F T T
F T F F F T T F F
F F F T T F F T F
Logic Unit 4: Semantics
Niko Scharer
3
b) Are these sentences consistent? yes
~ ( P Q) ( P Q )

P Q ~ (P Q) (P Q)
T T F T T T T T T
T F F T T F T F F
F T F F T T F F T
F F T F F F F T F

c) Are these sentences consistent, equivalent or neither? neither.
(~ P Q) ( Q P )

NEITHER, INCONSISTENT

P Q (~ P Q) (Q P)
T T F T F T T T T
T F F T F F F T T
F T T F T T T F F
F F T F F F F T F

4.4 EG3: Is this argument valid? (P ~Q) R . ~ R Q. ~P Q
Does { ((P ~Q) R ), (~ R Q) } tautologically imply (~P Q)?
VALID , TAUTOLOGICAL IMPLICATION



P Q R ((P ~ Q) R) (~ R Q) (~ P Q)
T T T T F F T T T T F T T T T F T T T Y
T T F T F F T F F F T F T T T F T T T
T F T T T T F T T F F T F F T F T T F
T F F T T T F T F T T F T F T F T T F Y
F T T F F F T T T T F T T T T T F T T Y
F T F F F F T F F F T F T T T T F T T
F F T F F T F T T F F T F F T T F F F
F F F F F T F F F F T F T F T T F F F



Logic Unit 4: Semantics
Niko Scharer
4
4.4 E1: Construct a full truth-table for each of the following sentences. Determine whether
each sentence is a tautology, a contradiction or a contingent sentence.
a) Q (S Q)
b) (T ~T) ~ (T ~T)
c) (P Q) (~P ~Q)
d) [ (P Q) (Q R)] (P ~R)
e) ~ P ((P Q) Q)
f) (W X) ((Y ~Y) W)
g) ~ S ((T S) U)
h) ((P Q) R) ((P Q) (~P R))
i) (S (Q V)) ( ~ (V ~Q) S)


a) Q (S Q) TAUTOLOGY

Q S Q (S Q)
T T T T T T T
T F T T F T T
F T F T T F F
F F F T F T F

b) (T ~T) ~ (T ~T) TAUTOLOGY

T (T ~ T) ~ (T ~ T)
T T F F T T T T F F T
F F F T F T T F F T F

c) (P Q) (~P ~Q)) TAUTOLOGY

P Q (P Q) (~ P ~ Q)
T T T T T T F T T F T
T F T F F T F T T T F
F T F F T T T F F F T
F F F T F T T F T T F


Logic Unit 4: Semantics
Niko Scharer
5
d) [ (P Q) (Q R)] (P ~R) CONTRADICTION



P Q R [(P Q) (Q R)] (P ~ R)
T T T T T T T T T T F T F F T
T T F T T T F T F F F T T T F
T F T T F F F F T T F T F F T
T F F T F F F F T F F T T T F
F T T F T T T T T T F F F F T
F T F F T T F T F F F F F T F
F F T F T F T F T T F F F F T
F F F F T F T F T F F F F T F

e) ~ P ((P Q) Q) TAUTOLOGY

P Q ~ P ((P Q) Q)
T T F T T T T T T T
T F F T T T T F F F
F T T F T F T T T T
F F T F T F F F T F

f) (W X) ((Y ~Y) W) CONTINGENT



W X Y (W X) ((Y ~ Y) W)
T T T T T T F T F F T F T
T T F T T T F F F T F F T
T F T T F F T T F F T F T
T F F T F F T F F T F F T
F T T F F T T T F F T F F
F T F F F T T F F T F F F
F F T F F F T T F F T F F
F F F F F F T F F T F F F

Logic Unit 4: Semantics
Niko Scharer
6
g) ~S ((T S) U) TAUTOLOGY




S T U ~ S ((T S) U)
T T T F T T T T T T T
T T F F T T T T T F F
T F T F T T F F T T T
T F F F T T F F T T F
F T T T F T T F F T T
F T F T F T T F F T F
F F T T F T F F F T T
F F F T F T F F F T F

h) ((P Q) R) ((P Q) (~P R)) CONTINGENT



P Q R ((P Q) R) ((P Q) (~ P R))
T T T T T T T T T T T T T F T T T
T T F T T T T F T T T T T F T T F
T F T T F F T T T T T F T F T T T
T F F T F F F F F T T F T F T T F
F T T F F T T T T F T T T T F T T
F T F F F T F F T F T T F T F F F
F F T F F F T T F F F F F T F T T
F F F F F F T T F F F F F T F F T

i) (S (Q V)) ( ~ (V ~Q) S) CONTRADICTION

Q S V (S (Q V)) (~ (V ~ Q) S)
T T T T T T T T F F T T F T F T
T T F T F T F F F T F F F T T T
T F T F T T T T F F T T F T F F
T F F F T T F F F T F F F T F F
F T T T T F T T F F T T T F F T
F T F T T F T F F F F T T F F T
F F T F T F T T F F T T T F F F
F F F F T F T F F F F T T F F F
Logic Unit 4: Semantics
Niko Scharer
7
4.4 E2: Construct a full truth-table for each of the following pairs of sentences. Determine
whether each pair is equivalent.
a) not equivalent ~ (P Q) ~P ~Q

P Q ~ (P Q) ~ P ~ Q
T T F T T T F T F F T
T F T T F F F T F T F
F T T F F T T F F F T
F F T F F F T F T T F

b) equivalent P (Q P) (R ~R) (Q Q)

P Q R P (Q P) (R ~ R) (Q Q)
T T T T T T T T T F F T T T T T
T T F T T T T T F F T F T T T T
T F T T T F T T T F F T T F T F
T F F T T F T T F F T F T F T F
F T T F T T F F T F F T T T T T
F T F F T T F F F F T F T T T T
F F T F T F T F T F F T T F T F
F F F F T F T F F F T F T F T F


c) equivalent T (S R) ~T (~S ~R)


R S T T (S R) ~ T (~ S ~ R)
T T T T T T T T F T T F T F F T
T T F F F T T T T F F F T F F T
T F T T T F T T F T T T F F F T
T F F F F F T T T F F T F F F T
F T T T T T T F F T T F T F T F
F T F F F T T F T F F F T F T F
F F T T F F F F F T F T F T T F
F F F F T F F F T F T T F T T F


Logic Unit 4: Semantics
Niko Scharer
8
d) not equivalent P (Q R) (P Q) R

P Q R P (Q R) (P Q) R
T T T T T T T T T T T T T
T T F T T T T F T T T T F
T F T T T F T T T F F T T
T F F T F F F F T F F F F
F T T F F T T T F F T T T
F T F F F T T F F F T F F
F F T F F F T T F F F T T
F F F F F F F F F F F F F

e) not equivalent (P ~(S T)) ~S (S ~(P T)) ~ P

P S T (P ~ (S T)) ~ S (S ~ (P T)) ~ P
T T T T T F T T T F F T T T F T T T F F T
T T F T T T T F F F F T T T T T F F F F T
T F T T T T F F T T T F F F F T T T T F T
T F F T T T F F F T T F F T T T F F F F T
F T T F F F T T T T F T T T T F F T T T F
F T F F T T T F F F F T T T T F F F T T F
F F T F T T F F T T T F F T T F F T T T F
F F F F T T F F F T T F F T T F F F T T F

f) equivalent (W X) ~(W X) W X

W X (W X) ~ (W X) W X
T T T T T T F T T T T T T
T F T F F F F T T F T F F
F T F F T F F F T T F F T
F F F F F T T F F F F T F


Logic Unit 4: Semantics
Niko Scharer
9
g) not equivalent P ~(W ~Y) (Y ~P) W


P W Y P ~ (W ~ Y) (Y ~ P) W
T T T T T F T T F T T F F T T T
T T F T T F T T T F F T F T T T
T F T T T T F F F T T F F T F F
T F F T T F F T T F F T F T T F
F T T F F F T T F T T T T F T T
F T F F F F T T T F F F T F T T
F F T F T T F F F T T T T F T F
F F F F F F F T T F F F T F F F
4.4 E3: Construct a full truth-table for each of the following sets of sentences. Determine
whether each set is consistent or inconsistent.
a) inconsistent P (R ~S). ~(P ~(S R)

P R S P (R ~ S) ~ (P ~ (S R))
T T T T T T T F T F T T F T T T
T T F T T T T T F F T T F F T T
T F T T F F F F T F T T T T F F
T F F T T F T T F F T T F F T F
F T T F F T T F T T F F F T T T
F T F F F T T T F T F F F F T T
F F T F F F F F T F F T T T F F
F F F F F F T T F T F F F F T F

b) Inconsistent P Q. R P. R ~Q.

P Q R P Q R P R ~ Q
T T T T T T T T T T F F T
T T F T T T F T T F F F T
T F T T F F T T T T T T F
T F F T F F F T T F F T F
F T T F T T T F F T F F T
F T F F T T F T F F F F T
F F T F T F T F F T T T F
F F F F T F F T F F F T F

Logic Unit 4: Semantics
Niko Scharer
10
c) consistent W ~Y. (W Z) (~Y Z). Z ~W.

W Y Z W ~ Y (W Z) (~ Y Z) Z ~ W
T T T T F F T T T T T F T T T T F F T
T T F T F F T T T F F F T F F F T F T
T F T T T T F T T T T T F T T T F F T
T F F T T T F T T F T T F T F F T F T
F T T F T F T F T T T F T T T T T T F
F T F F T F T F F F F F T F F F F T F
F F T F F T F F T T T T F T T T T T F
F F F F F T F F F F F T F T F F F T F

d) consistent. P (Q R). R (~Q P). Q ~R.

P Q R P Q R R (~ Q P) Q ~ R
T T T T T T T T T T F T T T T F F T
T T F T T T T F F T F T T T T T T F
T F T T T F T T T T T F T T F T F T
T F F T F F F F F T T F T T F F T F
F T T F F T T T T F F T F F T F F T
F T F F F T T F F T F T F F T T T F
F F T F F F T T T T T F T F F T F T
F F F F T F F F F T T F T F F F T F

e) see next page
f) consistent (P (Q ~S)) (S ~P). ~(Q ~P).

P Q S (P (Q ~ S)) (S ~ P) ~ (Q ~ P)
T T T T F T F F T T T F F T T T F F T
T T F T T T T T F T F T F T T T F F T
T F T T T F T F T F T F F T F F T F T
T F F T T F T T F T F T F T F F T F T
F T T F F T F F T T T T T F F T T T F
F T F F F T T T F T F T T F F T T T F
F F T F F F T F T T T T T F T F F T F
F F F F F F T T F T F T T F T F F T F


Logic Unit 4: Semantics
Niko Scharer
11
e) CONSISTENT S (R Q). Q ~T. T (~R S).

Q R S T S (R Q Q ~ T T (~ R S)
T T T T T T T T T T F F T T F F T F T
T T T F T T T T T T T T F F T F T F T
T T F T F T T T T T F F T T F F T F F
T T F F F T T T T T T T F F T F T F F
T F T T T T F T T T F F T T T T F T T
T F T F T T F T T T T T F F T T F T T
T F F T F T F T T T F F T T F T F F F
T F F F F T F T T T T T F F T T F F F
F T T T T T T T F F T F T T F F T F T
F T T F T T T T F F F T F F T F T F T
F T F T F T T T F F T F T T F F T F F
F T F F F T T T F F F T F F T F T F F
F F T T T F F F F F T F T T T T F T T
F F T F T F F F F F F T F F T T F T T
F F F T F T F F F F T F T T F T F F F
F F F F F T F F F F F T F F T T F F F


4.4 E4: Construct a full truth-table for each of the following arguments. Determine whether it is
valid.


a) valid P Q. Q R. ~P R.


P Q R P Q Q R ~ P R
T T T T T T T T T F T T T
T T F T T T T F F F T F F
T F T T F F F T T F T T T
T F F T F F F T F F T F F
F T T F F T T T T T F T T
F T F F F T T F F T F T F
F F T F F F F T T T F T T
F F F F F F F T F T F T F

Logic Unit 4: Semantics
Niko Scharer
12
b) invalid S (T W). ~T. ~ (S T).

S T W S (T W) ~ T ~ (S T)
T T T T T T T T F T F T T T
T T F T T T T F F T F T T T
T F T T T F T T T F F T T F
T F F T F F F F T F F T T F
F T T F T T T T F T F F T T
F T F F T T T F F T F F T T
F F T F T F T T T F T F F F
F F F F T F F F T F T F F F

c) invalid ~ (P (~S Q)). S (P Q). ~P ~S.

P Q S ~ (P (~ S Q)) S (P Q) ~ P ~ S
T T T F T T F T F T T T T T T F T T F T
T T F F T T T F T T F T T T T F T F T F
T F T F T T F T F F T F T F F F T T F T
T F F F T T T F F F F T T F F F T F T F
F T T T F F F T F T T T F T T T F F F T
F T F F F T T F T T F T F T T T F T T F
F F T T F F F T F F T T F T F T F F F T
F F F T F F T F F F F T F T F T F T T F

d) valid ~R (S ~T). S R. ~R T. ~S.

R S T ~ R (S ~ T) S R ~ R T ~ S
T T T F T F T F F T T T T F T T T F T
T T F F T T T T T F T T T F T F F F T
T F T F T T F T F T F T T F T T T T F
T F F F T F F F T F F T T F T F F T F
F T T T F T T F F T T F F T F T T F T
F T F T F T T T T F T F F T F T F F T
F F T T F T F T F T F T F T F T T T F
F F F T F T F F T F F T F T F T F T F



Logic Unit 4: Semantics
Niko Scharer
13
e) Invalid R Q. ~(S T) R. ~T ~Q

Q R S T R Q ~ (S T) R ~ T ~ Q
T T T T T T T F T T T F T F T F F T
T T T F T T T T T F F T T T F T F T
T T F T T T T T F F T T T F T F F T
T T F F T T T T F F F T T T F T F T
T F T T F T T F T T T T F F T F F T
T F T F F T T T T F F F F T F T F T
T F F T F T T T F F T F F F T F F T
T F F F F T T T F F F F F T F T F T
F T T T T F F F T T T F T F T T T F
F T T F T F F T T F F T T T F T T F
F T F T T F F T F F T T T F T T T F
F T F F T F F T F F F T T T F T T F
F F T T F T F F T T T T F F T T T F
F F T F F T F T T F F F F T F T T F
F F F T F T F T F F T F F F T T T F
F F F F F T F T F F F F F T F T T F
Logic Unit 4: Semantics
Niko Scharer
14
4.5 SHORTENED TRUTH-TABLES

4.5 EG1
Show that this sentence is not a contradiction: ((P Q) R) (Q ~R)

F F T F
P Q R ((P Q) R) (Q ~ R)
F T F F F T T F T T T T F

4.5 EG2: Lets try a few:
a) Show that the following sentence is not a tautology:
~ (S P) (Q R) ~(R P) (S Q)
P Q R S
F F F T

F T T F F T F F F
[~ ( S P ) ( Q R )] [~ ( R P ) ( S Q )]
F T F F T F T F F

b) Show that these sentences are consistent:
R (P Q) R (P S) ~ (Q S)

P Q R S
T F F F

F F
R (P Q) R (P S) ~ (Q S)
T T T F F F
X T T T T F T F F
F T T T F F T T F T F F F
Logic Unit 4: Semantics
Niko Scharer
15

c) Show that this argument is invalid:

S P Q (R S) ~P (Q R)
P Q R S
F F F F

F F F
(S P) (Q ( R S )) (~ P ( Q R))
T T F T T/F T F T F F F F T/F

4.5 E1: Construct a shortened truth table for each of the following that shows what is asked.

Show that each of the following is not a tautology:

a) ((P Q) ~S) (P (Q ~S))
P Q S
F F F

F
((P Q) ~ S) (P (Q ~ S))
F F F T T F F F F F F T F
b) [~P (Q (S P))] ((S ~P) Q)
P Q S
F F T

F
[~ P (Q (S P))] ((S ~ P) Q)
T F T F T T T F F T T T F F F


Logic Unit 4: Semantics
Niko Scharer
16
c) [(W ~X) (~(W Y) Z)] (~Z ~X)
W X Y Z
F T T F

F
[(W ~ X) (~ (W Y) Z)] (~ Z ~ X)
F T F T T F F T T T F F T F F F T

Show that each of the following is not a contradiction:

Show that each of the following is not a contradiction:
d) [(P Q) (P R)] (Q ~R)

P Q R
T F F

T
[(P Q) (P R)] (Q ~ R)
T F F F T F F T F F T F


e) ((P Q) (R ~R)) (P Q)
Any TVA in which P and Q have different truth-values will make this sentence true.
P Q R
T F T

T
((P Q) (R ~ R)) (P Q)
T F F T T F F T T T T F

Logic Unit 4: Semantics
Niko Scharer
17


f) [~ (S T) (U S) ] ~ [ ~U ~ (T S)]

S T U
T F F

T
[~ (S T) (U S)] ~ [~ U ~ (T S)
T T F F T F T T T T T F F F F T T

Show that each of the following is a contingent sentence:
g) (S T) (T R) (R S) There are many solutions to this one.

R S T (S T) (T R) (R S)
T T T T T T T T T T T T T T
T T F T F F F F T T F T T T

h) (P (~Q R)) (R ~(P Q))
In this one, only one TVA makes it false. The rest make it true.

P Q R (P (~ Q R)) (R ~ (P Q))
T T T T T F T F T T T F F T T T
F T T F F F T F T F T F F F T T





Logic Unit 4: Semantics
Niko Scharer
18
i) ~ [(P ~S) ((RT) (T P))] There are many solutions to this one.

P R S T ~ [(P ~ S) ((R T) (T P))]
F F T F T F F F T F F F F T F T F
T T T T F T T F T T T T T T T T T


Show that the following pairs are not equivalent:
Show that the following pairs are not equivalent:
j) ~( ~W ~(X Y)). (X Y) ~W.


W X Y ~ (~ W ~ (X Y) (X Y) ~ W
T T T T F T F F T T T T T T F F T


k) ~(P Q) (R Q). R (P Q).

P Q R ~ (P Q) (R Q) R (P Q)
F T T F F T T T T T T T F F F T

l) (~P Q) ~(R S). ~ (R P) ~ (Q S).
P Q R S
F F F T


(~ P Q) ~ (R S) ~ (R P) ~ (Q S)
T F F F F F F T T T F F F T T F F T
Logic Unit 4: Semantics
Niko Scharer
19
Show that the following sets are consistent:
m) P ~Q. P R. R Q.

n) ~ (S T) (U W). U T. ~S ~W.
These sentences are also all true if S and W are both true, but U and T are both false.
S T U W
F T T F


~ (S T) (U W) U T ~ S ~ W
F F T T T T F F T T T T F T T F

o) (P Q) ~(S Q). S ~Q. ~P T. ~T S.

P Q S T
T F T F

(P Q) ~ (S Q) S ~ Q ~ P T ~ T S
T T F T F T T F T T T F F T T F T F T T

p) (Q R) (S ~T). (T Q) (S ~R). ~(P ~(T R)).
P Q R S T
F T F T

(Q R) (S ~ T) (T Q) (S ~ R) ~ (P ~ (T R))
F F T T F F F T T T F T F T F T T F F F T T T

P Q R P ~ Q P R R Q
T F T T T T F T T T T T F
Logic Unit 4: Semantics
Niko Scharer
20
Show that the following are not valid arguments:
q) P (Q S). ~S. ~P (This is also shown by TVA: P=T, Q=F, S=F)
P Q S
T T F

P (Q S) ~ S ~ P
T T T T F T F F T

r) ~(T ~(R ~S)). R (T S). ~T ~R.
This is also shown by TVA: R=T, S=T, T=F
R S T
T F F

~ (T ~ (R ~ S)) R (T S) ~ T ~ R
T F F F T T T F T T F T F T F F F T

s) (P Q) (R S). (Q ~S) (~S P) P
P Q R S
F F T/
F
T

(P Q) (R S) (Q ~S) (~ S P) P
F T F T T T F T FT T F T T F F

t) ~((P T) (S W)). ~(T ~Q). (P Q) (R S)
P Q R S T W
T T F T T F
~ ((P T) (S W)) ~ (T ~ Q) (P Q) (R S)
T T T T F T F F T T F F T T T T F F F T

Logic Unit 4: Semantics
Niko Scharer
21
4.7 EG3: Now for some more complicated ones.
a) Rhonda says: Will is knight and Sam is a knave.
Will says: Sam is not a knave.
Patty says: Will and Sam are either both knaves or they are both knights.
Sam says: Rhonda is a knave.

R: Rhonda is a knight. W: Will is a knight. P: Patty is a knight. S: Sam is a knight.

P R S W
T F T T
Rhonda is a knave, the rest are knights.
R W ~ S W S P (W S) S ~ R
T T T T
T T T T F T F F
F T T F F T T T T T T T T T T T F


b) Peter says: Sarah would say that I am a knight.*
Randy says: Of Peter and myself, exactly one is a knight.
Sarah says: Randy is not a knave.

* Peter is a knight if and only if [Sarah would say Peter is a knight] .
We symbolize Sarah would say Peter is a knight: S P
(Sarah is a knight if and only if what she says is true.)
Thus * line is symbolized: P (S P) (Peter is a knight if and only if [S P] )

P R S
F T T
Peter is a knave, the others are knights.

P (S P) R (P ~ R) (R ~P) S R
T T T
T T T T T F T F F T T T F F T T
F T F F T T F T F T T T T T T T
Logic Unit 4: Semantics
Niko Scharer
22

c) Peggy says: Zoe would say that Quinton is a knight.
Quinton says: Shawna and I are not the same.
Ryan says: Shawna is a knave.
Shawna says: Either I am a knight or Zoe is a knave.
Zoe says: Peggy is a knave unless Ryan is.

Again, you need to symbolize Peggys statement as a biconditional with the right side a further
biconditional.

Quintons statement is that Quinton and Shawna are not the same. Quinton is a knight if and
only if Shawna is a knave. This can be symbolized: Q ~S OR ~ (Q S). Thus, Quinton
is a knight if and only if [Quinton and Shawna are not the same].

Q (Q ~S)

P Q R S Z
F F T F T

Peggy, Quinton and Shawna are knaves. Ryan and Zoe are knights.

P (Z Q) Q (S ~ Q) R ~ S
T T T
F T F F F T F F T F T T F


S (S ~ Z) Z (~ P ~ R)
T T
F F F F T T T F T F T



Logic Unit 4: Semantics
Niko Scharer
23
d) Poppy: Qasim is a knave and Ralph is a knight.
Qasim: Poppy would say I am a knave.
Ralph: Qasim and I arent the same.
P ~Q R
Q (P ~Q)
R ~(Q R)

P Q R
T F T

All of them are knaves.

P ~ Q R Q (P ~ Q) R ~ (Q R)
T T T
F T F F F F F F T F F F F T F

e) Rianna: Ursula would say that Waldo is a knave.
Stuart: Vinnie would tell you that Trixie is a knave.
Trixie: Rianna and Waldo are both knights or both knaves.
Ursula: Trixie is a knight or I am a knight.
Vinnie: Stuart is a knight or Rianna is a knight, but not both.
Waldo: I am a knight and Vinnie is a knave
R S T U V W
F F F T F T

Ursula and Waldo are knights, the rest are knaves.
R (U ~ W) S (V ~ T) T (R W)
T T T
F T F F T F F F T F F F F T

U (T U) V ~ (S R) W (W ~ V)
T T T
T F T T F F F T F T T T T F


Logic Unit 4: Semantics
Niko Scharer
24

f) Paul says: If Rory is a knight then so is Walter.
Queenie says: Uri is a knave or Walter is a knight.
Rory says: Queenie and Uri are both knights.
Suzy says: Vals a knave
Uri says: Walters a knave but Rory is a knight.
Val says: Paul and Rory are the same.
Walter says: Either Im a knight or Vals a knave.

Remember: you may have to try two possibilities.
P Q R S U V W
T T F T F F T

Paul, Queenie, Suzy and Walter are knights. The other three are knaves.
P (S W) Q (~ U W) R (Q U)
T T T
T T T T T T F T T F T F F
T F T F T F F T F F T T T T

S ~ V U (~ W R) V (P R)
T T T
T T F F F T F F F T F F
F F T T T F T T T T T T


W (W ~ V)
T
T T T T F
F F F F T

You might also like