Chapter 7 Exercises
Chapter 7 Exercises
Chapter 7 Exercises
Deduction
¬A→B
B→A
A→(C ∧ D)
¬A→B
B→A
A→(C ∧ D)
¬A→B
B→A
A→(C ∧ D)
(a) Prove, via tableaux and via resolution, that the given set is inconsi-
stent.
(b) Prove, via tableaux and via resolution, that all the pairs of formulas,
are consistent.
1.Rains→W et
2.W et→¬Rains
3 Rains
With resolution:
1.¬Rains ∨ W et
2. ¬W et ∨ ¬Rains
3. Rains
(a) The given set is inconsistent:
4. ¬Rains from 1 and 2
5. {} from 3 and 4
(b) From 1 and 2 we get ¬Rains; from 1 and 3 we get ¬W et; from 2
and 3 we get ¬W et, so no pair is inconsistent.
1.Rains→W et
2.W et→¬Rains
3 Rains
R→W
W →¬R
R
¬R? W
¬W ? ¬R?
The tableau closes, hence the three formulas are inconsistent.
1.Rains→W et
2.W et→¬Rains
R→W
W →¬R
¬R W
¬W ¬R ¬W ? ¬R
The tableau is open, hence the two formulas are consistent.
1.Rains→W et
3 Rains
R→W
R
¬R? W
The tableau is open, hence the two formulas are consistent.
2.W et→¬Rains
3 Rains
With tableaux
W →¬R
R
¬W ¬R?
The tableau is open, hence the two formulas are consistent.
(A→C) ∧ (B→C)
¬[(A ∨ B)→C]
(A ∨ B)
¬C
A→C
B→C
¬A C?
¬B C?
A? B?
(A ∨ B)→C
¬[(A→C) ∧ (B→C)]
¬(A ∨ B) C
¬A ¬(A→C) ¬(B→C)
¬B A B
¬(A→C) ¬(B→C) ¬C? ¬C?
A B
¬C? ¬C?
(C ∧ F )→E
(¬L ∧ ¬F )→¬E
F
E
¬(C ∧ F ) E
¬C ¬F ? ¬(¬L ∧ ¬F ) ¬E?
¬(¬L ∧ ¬F ) ¬E? L F
L F
[(A→C) ∨ (B→C)]
¬[(A ∧ B)→C]
A∧B
¬C
A
B
A→C B→C
¬A? C? ¬B? C?
The formula is valid, as the tableau for its negation closes.
The tableau for the negated formula closes, hence it is valid, which implies
that the formula is satisfiable, and not a contradiction.
b. with Resolution.
b. C can be derived with Resolution
1. ¬A ∨ C
2. ¬B ∨ C
3. A∨B
4. ¬C negated thesis
5. B ∨ C from 1. and 3.
6. C from 2. and 5.
7. { } from 4. and 6.
1. (P ∧ R)↔(R ∧ P )
2. (P ∨ ¬P )↔(P ∧ ¬P )
3. ¬P →(P ∧ ¬P )
4. (P ∨ Q)↔P
¬[(P ∧ R)↔(R ∧ P )]
P ∧R ¬(P ∧ R)
¬(R ∧ P ) R∧P
P R
R P
¬R? ¬P ? ¬R? ¬P ?
¬[(P ∨ ¬P )↔(P ∧ ¬P )]
P ∨ ¬P ¬(P ∨ ¬P )
¬(P ∧ ¬P ) P ∧ ¬P
P ¬P ¬P
P ¬P ? P ¬P ? P?
(P ∨ ¬P )↔(P ∧ ¬P )
P ∨ ¬P ¬(P ∨ ¬P )
P ∧ ¬P ¬(P ∧ ¬P )
P
¬P ? ¬P
P?
The tableau is closed.
(P ∨ ¬P )↔(P ∧ ¬P ) is contraditory.
¬[¬P →(P ∧ ¬P )]
(P ∨ Q)
P
¬(P ∧ ¬P )
¬P ? P
The tableau is open.
¬P →(P ∧ ¬P ) is not valid.
¬P →(P ∧ ¬P )
P (P ∧ ¬P )
P
¬P ?
The tableau is open.
¬P →(P ∧ ¬P ) is satisfied by { P}
¬[(P ∨ Q)↔P ]
(P ∨ Q) ¬(P ∨ Q)
P P
¬P ¬P
P? Q Q?
(P ∨ Q)↔P
(P ∨ Q) ¬(P ∨ Q)
P ¬P
P Q ¬P
¬Q
A → (B ∨ C)
¬B
¬(A → C)
A
¬C
¬A? B∨C
B? C?
The tableau is closed.