Escolar Documentos
Profissional Documentos
Cultura Documentos
1093/philmat/nkj008
Advance Access publication January 9, 2006
RICHARD TIESZEN*
Philosophia Mathematica (III), Vol. 14 No. 2 The Author [2006]. Published by Oxford University Press.
All rights reserved. For Permissions, please e-mail: journals.permissions@oxfordjournals.org
230 TIESZEN
1
A disjunction like this is also stated in other places in Gödel’s writings. See, for
example, Volume V of the Collected Works, pp. 80 and 160.
2
Page numbers in Gödel references are to the Collected Works.
AFTER GÖDEL: MECHANISM, REASON, AND REALISM 231
denumerably many different Turing machines and for each of them there
is some absolutely unsolvable diophantine problem of the type Gödel
mentions. So Gödel’s disjunction, understood in this manner, is
presumably a mathematically established fact. It is not possible to reject
both disjuncts.
Three possibilities are left open by the disjunction:
(2) the human mind does not infinitely surpass the powers of any finite
machine (TM) and there are absolutely unsolvable diophantine
problems. That is, the human mind is a finite machine and there are
for it absolutely unsolvable diophantine problems.
(3) the human mind infinitely surpasses the powers of any finite
machine and there are absolutely unsolvable diophantine problems.
(4) the human mind infinitely surpasses the powers of any finite
machine and there are no absolutely unsolvable diophantine
problems.
Gödel has some interesting things to say about each of these possibilities but
it is clear from some of his later writings in particular that he favors option
(4). In this paper I want to consider what it could mean to favor this option
and how one might defend such a choice. I think that in order to defend the
choice we need to reassess the role of human reason and of realism in
mathematics. In discussions I had with Hao Wang in the mid-nineteen
eighties Wang told me that Gödel hoped to use ideas in Husserl’s
phenomenology to show, among other things, that the human mind is not
a machine. A passage of a draft letter found recently in the Gödel Nachlass
confirms Wang’s comments (see [van Atten and Kennedy, 2003, p. 460]).
My discussion below will be structured by this suggestion (see also Part II of
[Tieszen, 2005]). In the final section of the paper I will include a few ideas
about the prospects for solving open mathematical problems that are implied
by or at least compatible with the non-mechanist view of the mind I present.
1. Some Remarks of Gödel on Minds and Machines
I begin by noting a few remarks of Gödel that reflect his anti-mechanist
reading of the incompleteness theorems. These remarks form the
backdrop for much of what I will say below. One such remark already
appears in an early paper:
The generalized undecidability results do not establish any
bounds for the powers of human reason, but rather for the
potentialities of pure formalism in mathematics . . . Turing’s
analysis of mechanically computable functions is independent
of the question whether there exist finite non-mechanical
procedures . . . such as involve the use of abstract terms on the
basis of their meaning. [Gödel, 1934, p. 370]
232 TIESZEN
Note that while the procedures Gödel speaks of here are finite they are
evidently not mechanical because they involve the use of ‘abstract terms
on the basis of their meaning’. Human reason may be able to use abstract
terms on the basis of their meaning whereas this is not a possibility in
the case of pure formalism or mechanism. In the discussion below I will
highlight this idea. A similar theme is sounded in the following passage,
although Gödel adds that human reason is capable of constantly
developing its understanding of the abstract terms:
consistent then there is a sentence GT, the Gödel sentence for T, such that
0T GT and 0T : GT. The second theorem says that if T is consistent then
0T CON(T), where ‘CON(T)’ is the formalized statement that asserts
the consistency of T. The first theorem tells us that GT cannot be decided
by T but that GT is true if T is consistent. It does not tell us that GT is
absolutely undecidable. It is only undecidable relative to T. Gödel
frequently emphasizes how sentences that are undecidable in some
theories are in fact decided in certain natural extensions of those theories
(e.g., by ascending to higher types). T can be, for example, primitive
recursive arithmetic (PRA), Peano arithmetic (PA), Zermelo-Fraenkel set
theory (ZF), and so on. The theorems tell us that such formal theories T
cannot be finitely axiomatizable, consistent, and complete. The second
theorem suggests, generally speaking, that if there is a consistency proof
for a theory T then it will be necessary to look for ‘T0 CON(T), where T is a
proper subsystem of T0 .
A very likely candidate for C is PRA. PA is arguably less suitable,
given the distinctions described in the first paragraph of this section. In
whatever manner we construe C, however, it follows from the first
theorem that if C is consistent then the Gödel sentence for C cannot be
decided by C even though it is true. It follows from the second theorem
that if C is consistent then C cannot prove CON(C). Given the way we
characterized C above, it follows that deciding the Gödel sentence for C
or proving CON(C) must require objects or concepts that cannot be
completely represented in space-time as finitary, concrete, real and
immediately intuitable. In other words, deciding the Gödel sentence for C
or proving that CON(C) must require appeal to the meanings of sign
configurations, to objects or concepts that are in some sense infinitary,
ideal, or abstract and not immediately intuitable (see also [Gödel, 1972]).
Were there no insight into such objects, were we able to proceed only from
within C, then we would evidently have to stop with respect to deciding
the Gödel sentence for C or obtaining a proof of CON(C). That is, we
could not decide some clearly posed mathematical problem. (I mean we
could not decide it unless the decision were to be made arbitrarily or on
non-mathematical grounds.) However, for some T (e.g., PRA, PA) we in
fact do have proofs of CON(T) and decisions of related problems. The
human mind, in its use, is not static but is constantly developing.
It is worth noting that we can obtain a reasonably good understanding
of the sense in which the objects or concepts used in the decisions or
consistency proofs must be abstract, infinitary, and not completely
captured in immediate intuition. In the case of PA, for example, the
consistency proof requires the use of transfinite induction on
ordinals < e0, or it requires primitive recursive functionals of finite
type. Thus, some kind of epistemic capacity that takes us beyond C seems
to be required. It seems that cognitive acts of abstraction, generalization,
AFTER GÖDEL: MECHANISM, REASON, AND REALISM 237
3
[Hauser, forthcoming] contains further discussion of Gödel’s program for set theory
in connection with ideas in phenomenology.
238 TIESZEN
4
In [*1961/?, p. 383] Gödel says, without much elaboration, that Husserl’s phenom-
enology would have us direct our attention onto our own acts in our use of concepts,
onto our powers of carrying out our acts, and so on. It is this kind of approach that
Gödel thinks is promising. What I do in this paper is to provide some elaboration on this
kind of view.
240 TIESZEN
5
I take intensionality to be linked to intentionality in the following way: expressions
for mental acts that exhibit intentionality (e.g., knowledge, belief, hope) create inten-
sional contexts; that is, contexts in which principles of standard extentional logic, such
as substitutivity salva veritate and existential generalization, fail. Roughly speaking, as
indicated above, one can think of contents of mental acts as meanings or intensions.
AFTER GÖDEL: MECHANISM, REASON, AND REALISM 243
6
Gödel’s interest in transcendental idealism certainly preceded his study of Husserl.
He of course studied Kant but see also his correspondence with G. Günther (pp. 476–
535), along with Parsons’s introduction to it, in Vol. IV of the Collected Works.
246 TIESZEN
however, because the Gödel sentence obtained for that system is formally
independent of the system. Instead, we refer through PA to what is not
enclosed in PA. PA does not adequately capture our arithmetic intentions
in the first place.
We have now suggested a way of putting minds and the directedness
toward abstract objects back into the picture. We have a combination of
leftward and rightward features that is different from Hilbert’s. Since the
combination is presumably at odds in some ways with the zeitgeist,
I would like to turn attention to Gödel’s remarks on the zeitgeist in order
to offer further defense of some of the ideas in this section.
7
See, e.g., [Gödel, *1961/?] and the letter to Rappaport quoted above. Hao Wang
also discusses this in [Wang, 1974, 1987, and 1996].
248 TIESZEN
(**). The claim that the human mind is a finite machine (a TM) rests
on a development that presupposes human intentionality, directedness, the
capacity for acts of abstraction, and so on. Our awareness of our own
consciousness, however, does not depend on building up layers of
scientific theory, abstraction, idealization, and so on. At the pre-reflective,
pre-scientific, level humans are already conscious interpreters of the
world who are directed toward various goals.8
The mechanist zeitgeist is thus an interpretive scheme that both reveals
and conceals. This is part of how I would explain the one-sidedness or
prejudice (in a hermeneutical sense) of the zeitgeist that Gödel mentions
in some of his remarks.
The new combination of leftward and rightward ideas I have been
sketching in this paper does not imply any kind of irrationalism. On the
contrary, it is possible to embrace it while adopting a healthy skepticism
toward superstition, mysticism, prophecy, and the like. We adopt a
rationalist skepticism to accompany our broader view of reason, science,
logic, mathematics, and evidence, instead of an exaggerated empiricist
skepticism that eliminates the mind and its directedness toward abstract
objects in the sciences of mathematics and logic. We include critical
reason but not pure uncritical reason. We see the worries that led to
finding a foundation for mathematics exclusively in concrete mathematics
as exaggerated. Of course we do not want idealizations, abstractions, and
forms of reflection that lead to inconsistency. Instead, we want to open up
a space in which we allow the broadest set of mathematical possibilities
and necessities compatible with scientific thinking.
A skepticism according to which everything about human subjectivity
is illusory, relative, or fluctuating is skepticism gone awry. There can be
some objectivity in the phenomenology of the human mind, for certainly
there are common structures of cognition that make sciences such as
mathematics possible. We can look for the invariants in human cognition
and at the same time do justice to the mind and its forms of directedness,
its capabilities for abstraction, and so on. In short, we need to keep both
subjectivity and objectivity in the picture.
8
It is sometimes claimed that even if the human mind is not a Turing machine it is
nonetheless some other kind of machine. I think the argument presented in this section
can be extended to cover any other conceptions of machines that involve the abstractions
discussed.
AFTER GÖDEL: MECHANISM, REASON, AND REALISM 251
9
Thus, I am suggesting that the quotation at the beginning of this paper, as well as
the famous list of open problems that Hilbert presented in 1900 [Hilbert, 1900] be read
in this manner.
I have discussed regulative ideals in mathematics in other places, e.g., [1989, pp. 39,
180–182, 193]. In Gödel’s case, the optimism about problem solving may also be con-
nected with ideas in Leibniz’s philosophy. See, e.g., the remarks at the end of [Gödel,
1944] or Gödel’s remarks on the principle of sufficient reason. On the basis of what I
have said, however, decidability as an ideal of reason cannot be construed as decidabil-
ity according to a purely mechanical conception of reason.
252 TIESZEN
R EFERENCES
GÖDEL, K. [1934]: ‘On undecidable propositions of formal mathematical
systems’, in [Gödel, 1986], pp. 346–371.
—— [*193?]: ‘Undecidable diophantine propositions’, in [Gödel, 1995],
pp. 164–175.
—— [1944]: ‘Russell’s mathematical logic’, in [Gödel, 1990], pp. 119–143.
—— [1946]: ‘Remarks before the Princeton Bicentennial Conference on
problems in mathematics’, in [Gödel, 1990], pp. 150–153.
—— [*1951]: ‘Some basic theorems on the foundations of mathematics and their
implications’, in [Gödel, 1995], pp. 304–323.
—— [*1953/9, III and V]: ‘Is mathematics syntax of language?’, in [Gödel,
1995], pp. 334–363.
—— [*1961/?]: ‘The modern development of the foundations of mathematics in
the light of philosophy’, in [Gödel, 1995], pp. 374–387.
—— [1964]: ‘What is Cantor’s continuum problem?’, in [Gödel, 1990],
pp. 254–270.
—— [1972]: ‘On an extension of finitary mathematics which has not yet been
used’, in [Gödel, 1990], pp. 271–280.
—— [1972a]: ‘Some Remarks on the Undecidability Results’, in [Gödel, 1990],
pp. 305–306.
—— [1986]: Collected Works, Vol. I. Feferman, S. et al., eds. Oxford: Oxford
University Press.
—— [1990]: Collected Works, Vol. II. Feferman, S. et al., eds. Oxford: Oxford
University Press.
—— [1995]: Collected Works, Vol. III. Feferman, S. et al., eds. Oxford: Oxford
University Press.
—— [2003a]: Collected Works, Vol. IV. Feferman, S. et al., eds. Oxford: Oxford
University Press.
—— [2003b]: Collected Works, Vol. V. Feferman, S. et al., eds. Oxford: Oxford
University Press.
HAUSER, K. [forthcoming]: ‘Gödel’s program revisited’, Husserl Studies.
HILBERT, D. [1900]: ‘Mathematische Probleme. Vortrag, gehalten auf dem
internationalen Mathematiker-Kongress zu Paris 1900’, Nachrichten von der
Königlichen Gesellschaft der Wissenschaften zu Göttingen, 253–297.
English translation by M. Newson in Bulletin of the American Mathematical
Society 8 (1902), 437–479.
—— [1926]: ‘Über das Unendliche’, Mathematische Annalen 95, 161–190.
English translation by S. Bauer-Mengelberg in [van Heijenoort, 1967],
pp. 367–392.
HUSSERL, E. [1936]: ‘Die Krisis der europäischen Wissenschaften und die
transzendentale Phänomenologie’, Philosophia 1, 77–176. See The Crisis of
the European Sciences and Transcendental Phenomenology. D. Carr, trans.
Evanston, Illinois: Northwestern University Press, 1970.
PARSONS, C. [1980]: ‘Mathematical intuition’, Proceedings of the Aristotelian
Society 80, 145–168.
—— [2003]: ‘Introductory note to correspondence with Gotthard Günther’,
in [Gödel, 2003a], pp. 457–476.
254 TIESZEN