Professional Documents
Culture Documents
Tarski - Truth and Proof
Tarski - Truth and Proof
numbers. Our
main problem is reduced then to the question: are the set of
provable
numbers identical?
To answer this question negatively, it suces, of course, to
indicate a single property that applies to one set but not to
the other. The property we shall actually exhibit may seem
rather unexpected, a kind of deus ex machina.
The intrinsic simplicity of the notions of formal proof and
formal provability will play a basic role here. We have seen
in the second section that the meaning of these notions is ex-
plained essentially in terms of certain simple relations among
sentences prescribed by a few rules of proof; the reader may
recall here the rule of modus ponens. The corresponding re-
lations among numbers of sentences are equally simple; it
turns out that they can be characterized in terms of the sim-
plest arithmetical operations and relations, such as addition,
multiplication, and equalitythus in terms occurring in our
arithmetical theory. As a consequence the set of provable
numbers could be
dened in the language of arithmetic, the antinomy of the
liar could actually be reconstructed in this language. Since,
however, we are dealing now with a restricted formalized lan-
guage, the antinomy would assume a more involved and so-
phisticated form. In particular, no expressions with an em-
pirical content such as the sentence printed in such-and-
such place, which played an essential part in the original
formulation of the antinomy, would occur in the new for-
mulation. We shall not go into any further details here.
Thus the set of provable