Logica: Capita selecta

Pawel Pawlowski
Homework assignment 1

Deadline: 17.04

GRADING: To get 1 point you need to solve two exercises plus the last exercise (the exercise number
21). To get 2 points, you need to solve 4 exercises plus the last exercise. You are more than welcome to
solve more exercises!

1. Find logical formulas ϕ1 , ϕ2 , ϕ3 with three variables whose truth-table in cpl is the following:

p q r ϕ1 ϕ2 ϕ3
0 0 0 1 1 1
0 0 1 0 1 0
0 1 0 1 1 1
1 0 0 1 0 0
1 1 0 1 0 1
1 0 1 0 0 0
0 1 1 0 1 1
1 1 1 0 1 0

2. Interpolation theorem. Let ϕ, ψ be formulas. If cpl ϕ → ψ, then there is a formula θ called an

interpolant such that each propositional variable occuring in θ occurs in both ϕ and ψ, and moreover
cpl ϕ → θ and cpl θ → ψ. Prove this theorem for classical propositional logic.
3. We say that logic L is Halldén complete iff L ϕ ∨ ψ implies that either L ϕ, or L ψ, for any ϕ, ψ
that do not shary any variables. It is known that cpl and modal logics S4,S5, KT KTB are Halldén
complete. Prove that K is not.
4. We say that logic L has a Disjunction property iff L ϕ ∨ ψ implies that either L ϕ, or L ψ, for
any ϕ, ψ. Clearly if a logic has the Disjunction property it is Halldén complete. What about
the reverse implication? You can rely on the information and theorems given in this exercise. Hint:
consider cpl.
5. Post-completeness. A logic L is Post-complete iff for any formula ϕ such that 0L ϕ, if we add
ϕ as an axiom scheme to L, then the resulting logic is inconsistent. So, post-complete logics in some
sense are maximal. They cannot be further strengthened. Prove that cpl is Post-complete. Hint:
consider an unprovable formula ϕ whose propositional parameters are p1 , . . . pn . Add this formula as
a schemata to the axioms. Show that the resulting system is not consistent.
6. For each of the three-valued logics presented during the first class check the philosophical and logical
literature and look for the motivations and applications of these logics and write a short passage about
them. Maximum half-page for each logic.

1
 7. Find a three-valued logic that is present in the literature and has not been mentioned during our class.
Provide short motivations behind the logic and possible applications. Specify the truth-tables for this
logic.
8. Define ϕ ≡ ψ as (ϕ → ψ) ∧ (ψ → ϕ). Provide truth-tables for each of the three-valued logics that we
have discussed.

9. Let Γ be a set of formulas. We say that Σ is a maximal cpl-consistent subset of Γ (Σ is a MCS of Γ)

iff
(a) Σ ⊆ Γ. (Σ is a subset of Γ)
(b) Σ is cpl-consistent i.e. there is no finite subset Σ1 of Σ such that Σ1 `cpl p ∧ ¬p. ( Σ is
cpl-consistent)
(c) For any formula ϕ ∈ Γ such that ϕ ∈
/ Σ, Σ ∪ ϕ is not consistent. ( Σ is maximal)
In this exercise we consider only finite Γ. We say that ϕ is:
(a) A strong Rescher-Manor consequence of Γ iff ϕ is a cpl-consequence of all MCS’s of Γ. In symbols
Γ `SRM ϕ.
(b) A weak Rescher-Manor consequence of Γ iff ϕ is a cpl-consequence of some MCS’s of Γ. In
symbols Γ `WRM ϕ.
(c) A C-based Rescher-Manor consequence of Γ iff ϕ is a cpl-consequence of all the largest (having
the greatest number of elements) MCS’s of Γ. In symbols Γ `CRM ϕ.

To see an example consider the set Γ = {p ∧ q, ¬q, (p ∨ ¬q) → s}. This set has two MCS’s Γ1 =
{p ∧ q, (p ∨ ¬q) → s} and Γ2 = {¬q, (p ∨ ¬q) → s}. Γ `WRM s, and Γ `SRM s.
Prove or disprove the following claims:

(a) For any Γ, ϕ, if Γ `SRM ϕ, then Γ `WRM ϕ.

(b) For any Γ, ϕ, if Γ `WRM ϕ, then Γ `SRM ϕ.
(c) For any Γ, ϕ, if Γ `WRM ϕ, then Γ `CRM ϕ.
(d) For any Γ, ϕ, if Γ `CRM ϕ, then Γ `WRM ϕ.
(e) For any Γ, ϕ, if Γ `SRM ϕ, then Γ `CRM ϕ.
(f) For any Γ, ϕ, if Γ `CRM ϕ, then Γ `SRM ϕ.

10. Try to provide an argument for the presence or lack of the following for each of the Rescher-Manor
consequences: monotonicity, idempotency, transitivity, reflexivity.
11. How many non-equivalent modalities S4, S4.2 have? The system S4.2 is obtained by adding the axiom
0.2, ♦ϕ → ♦ϕ to the system S4.

12. Matsumoto’s theorem. For any formula ϕ, `S4 ♦ϕ iff `S5 ϕ. Prove the left to right direction
of this theorem.
13. Consider the following statement: if `K ϕ1 ∨ ϕ2 ∨ ϕ3 , then `K ϕ1 ∨ ϕ2 ∨ ϕ3 . Is it true? If yes,
provide a proof. If not, explain why. Note that `K is the derivability relation of modal logic K. Hint:
Notice that modal logic K is closed under the following rule: if `K ϕ, then `K ϕ.

14. Consider the following statement: `S5 ϕ1 ∨ ϕ2 ∨ ϕ3 , then `S5 ϕ1 ∨ ϕ2 ∨ ϕ3 . Is it true? If yes,
provide a proof. If not, explain why. Note that `S5 is the derivability relation of modal logic S5.

2
15. Let the system K1 be axiomatized in the same way as K but instead of NEC, it has an an axiom >:
(ϕ → ϕ) and a rule R1 : if ` ϕ → ψ, then ` ϕ → ψ. Prove that K1 and K have exactly the same
theorems.Hint: show that K proves the axioms and that the additional rule of K1 is derivable. Next,
derive NEC in K1 .
16. Let the system K2 be axiomatized in the same way as K but instead of NEC and axiom K, it has axioms
> and K2 : ϕ ∧ ψ) → (ϕ ∧ ψ), and the rule R1 . Prove that K2 and K have exactly the same
theorems.
17. Let the system T1 be axiomatized in the same way as T but instead of K, it has an axiom T1 :
((ϕ → ψ) → (ϕ → ψ)). Prove that T1 and T have exactly the same theorems.

18. Prove that the system K has no theorems of the form ♦ϕ.
19. Prove that if ` ϕ, then ` ϕ is a rule of K but not in T.Hint: for syntactic proof check a book by
Chellas page 124 (Modal Logic: An Introduction).
20. Prove that if ` ϕ → ψ, then ` ϕ → ψ is a validity preserving rule in K but not in T.

21. Come up with at least one new exercise on your own.