You are on page 1of 1

(n.b. I use '[', ']' instead of '<','>' below to avoid confusion with '>' meaning "is greater than".

Let T be the set of truth sentences. Every natural number j, has a name ‘J’, and S_j = [for all k > J, S_k
~ \in T]. Note that ‘0’ is the name of the natural number 0.

Suppose that n is a natural number. Let 'N' be the name of that natural number, and 'M' the name of
n+1.

Suppose that S_n \in T.


1 Then, [for all k > N, S_k ~ \in T] \in T.
2 Then, for all k > N, S_k ~ \in T. (T-schema)
3 Then, for all k > n, S_k ~ \in T. (‘N’ is a name of n)
4 Then, for all k > n+1, S_k ~ \in T.
5 Then, for all k > M, S_k ~ \in T. (‘M’ is a name of n+1)
6 Then, [for all k > M, S_k ~ \in T] \in T. (T-schema)
7 So, S_{n+1} \in T
8 But S_{n+1} ~ \in T.

Thus, S_n ~ \in T.


Thus, for all n, S_n ~ \in T. (universal generalization)
Thus, for all n > 0, S_n ~ \in T.
Thus, S_0 \in T. (T-schema)
But, S_0 ~ \in T.

You might also like