Subject 24.242. Logic II. Problems set due Thursday, May 15.

1.

A partial order on a set W is a binary relation < that is transitive (if x < y and y < z, then x < z)
and antireflexive (you never have x < x). A set partial order is a set of sets partially ordered by
the proper-subset-of relation, that is S < T iff all members of S are members of T but not vice
versa. Show that a binary relation on W is a partial order if and only if it is isomorphic to a set
partial order. That is, there is a one-one function f from W onto a set of sets such that x < y iff
f(x) f(y).

2.

Define KTL to be the smallest normal modal system that contains both (T) and (L). Show that
every modal formula is in KLT.

3.

Which of the following modal formulas are in GL? If the formula is in GL, show it is, either by a
derivation or by an argument that its true in every finite tree model. If its not in GL, show this
by giving a finite tree model in which its false.
a)
b)
c)
d)
e)
f)
g)

(P 6 ~P)
(~P 6 P)
(P 6 P)
(P 6 P)
(~(P 6 Q) 6 (~(P v R) : ~(Q v R)))
((P v P) : P)
((P w P) : P)

4.

Formalized versions of the semantic paradoxes have been widely understood as showing that, if
you want to develop a semantic theory for an object language expressively rich enough to
describe its own syntax, semantic terms applicable to the object language, like true, cant
appear within the object language. Montagues Theorem appears to show that, for this purpose,
necessary counts as semantic term. Where Nec is a formula of the language of arithmetic that
is intended to represent necessity, let consist of the instances of the following schemata:
Nec([+ ,]), for an axiom of logic or an axiom of Q.
(Nec([+ n ,]) 6 n).
Nec([+ (Nec([+ n ,]) 6 n) ,]).
(Nec([+ (n 6 ) ,]) 6 (Nec([+ n ,]) 6 Nec([+ ,])))
Show that is inconsistent. [Hint: Construct a sentence provably equivalent to Nec([+ ,]).]

5.

True or false? Explain your answer: For any sentence n, the conditional (CON(PA) 6
(BewPA([+ n ,]) 6 n)) is provable in PA.

6.

True or false? Explain your answer: For any sentence n, the conditional (CON(PA) 6
(BewPA([+ n ,]) 6 n)) is provable in PA.