Professional Documents
Culture Documents
SECTION A 6AANB031
1. Use the propositional tableau proof systems to prove the following three
formulas
(a) 3(2X ⊃ 3Y ) ⊃ 3(X ⊃ Y ) in the system S4,
(b) 2(2X ⊃ 2Y ) ∨ 2(2Y ⊃ 2X) in the system S5,
(c) 2(3X ⊃ Y ) ≡ 2(X ⊃ 2Y ) in the system S5.
Use the constant domain tableau system to determine whether (d) is
valid on all K models with constant domain
(d) (3(∀x)A(x) ∧ 2(∃x)B(x)) ⊃ (∃x)3(A(x) ∧ B(x)).
Use the variable domain tableau system to determine whether (e) is
valid on all K models with varying domain
(e) (3(∀x)A(x) ∧ 2(∃x)B(x)) ⊃ 3(∃x)(A(x) ∧ B(x)).
2. (a) Is the following valid in T: 3(X ∧ Y ) ≡ (3P ∧ 3Y )? Justify your
answer.
(b) Show that the characteristic thesis of the Brouwerian system, X ⊃
3X, is not valid in S4.
(c) (a) Provide a model to show that (X ⊃ 3X) is not valid in
T.
(b) Provide a model that shows that (3X ⊃ X) is not valid
in S4.
3. (a) Let ‘CX’ abbreviate ‘It is contingently true that X’. Define CX
in terms of one of the standard modal operators and explain why
CX ⊃ 2CX is unacceptable.
(b) What are the modal systems S4 and S5? Under what conditions
on the accessibility relation on a model M for propositional modal
logic is M a model of (a) S4, (b) S5?
Show that 32X ⊃ 2X is true at every possible world of any S5
model but false at some possible world of some S4 model.
TURN OVER
2
6AANB031
SECTION B
5. Let (G, R) be the following frame: G = {0, 1, 2, 3 . . .}, the set of natural
numbers, and nRm holds if and only if n is a smaller number than
m. Let (G, R, `) be a model over (G, R). In such a model, ‘n ` X’,
means that natural number n has some property PX , that is, the model
interprets X as a specific property of natural numbers (eg., “n is smaller
than a given number a”, “n is a multiple of 3”, “n is 4, 7 or 18”, etc.).
TURN OVER
3
6AANB031
END OF PAPER