Professional Documents
Culture Documents
(PQ)
Add a case to the proof of metatheorem 6.3.1 that the resulting proof
system is sound. (Note: you are not being asked to prove that this
is an acceptable derived rule by producing a derivation it abbreviates.
Add a case to the proof of 6.3.1)
Say that we have a truth assignment A that makes all sentences in k+1
true. Since i j = k+1 this assignment A makes every sentence in
i true, and so it makes P true and A makes every sentence in j
true, and so it makes Q true.
If P and Q are both true, then P and Q are both false. By the
truth table for , if P and Q are both false then PQ is false:
1
P Q P Q
T T T T T
T F T T F
F T F T T
F F F F F
That is, any truth assignment making every sentence in k+1 true makes
PQ false, so it makes (PQ) true. So k+1 (PQ).
[NOTE: you must cite the completeness theorem to pass from a fact
about to a fact about .]
2
3. Prove that if is a maximally consistent in SD set of sentences of SL
then:
3
4. Formalize these two sentences using the given formalization key:
UD: all people Dx: x went to Disneyland
Kxy: x knows y
j: John
m: Mary
There is someone who knows both Mary and John but doesnt know
him/herself.
(x)((Kxm&Kxj)& Kxx)
4
6.
1 (x)( Qx P x) Assumption
2 (x)Qx Assumption
3 Qa A/E
4 Qa P a 1 E
5 Qa A/ E
6 (x)P x A/ E
7 Qa 3R
8 Qa 5R
9 (x)P x 6-8 / E
10 Pa A/ E
11 (x)P x 10 I
12 (x)P x 4, 5-9, 10-11 E
13 (x)P x 2, 3-12 E