Feferman and Turing Thesis
Feferman and Turing Thesis
Solomon Feferman
I
n the sole extended break from his life and var- ing in this way we can associate a sys-
ied career in England, Alan Turing spent the tem of logic with any constructive or-
years 1936–1938 doing graduate work at dinal. It may be asked whether such a
Princeton University under the direction of sequence of logics of this kind is com-
Alonzo Church, the doyen of American logi- plete in the sense that to any problem
cians. Those two years sufficed for him to complete A there corresponds an ordinal α such
a thesis and obtain the Ph.D. The results of the the- that A is solvable by means of the logic
sis were published in 1939 under the title “Systems Lα .
of logic based on ordinals” [23]. That was the first Using an ingenious argument in pursuit of this
systematic attempt to deal with the natural idea of aim, Turing obtained a striking yet equivocal par-
overcoming the Gödelian incompleteness of formal tial completeness result that clearly called for fur-
systems by iterating the adjunction of statements— ther investigation. But he did not continue that
such as the consistency of the system—that “ought himself, and it would be some twenty years before
to” have been accepted but were not derivable; in the line of research he inaugurated would be re-
fact these kinds of iterations can be extended into newed by others. The paper itself received little at-
the transfinite. As Turing put it beautifully in his tention in the interim, though it contained a num-
introduction to [23]: ber of original and stimulating ideas and though
Turing’s name had by then been well established
The well-known theorem of Gödel
through his earlier work on the concept of effec-
(1931) shows that every system of logic
tive computability.
is in a certain sense incomplete, but at
Here, in brief, is the story of what led Turing to
the same time it indicates means
Church, what was in his thesis, and what came
whereby from a system L of logic a
after, both for him and for the subject.1
more complete system L may be ob-
tained. By repeating the process we get From Cambridge to Princeton
a sequence L, L1 = L , L2 = L1 … each As an undergraduate at King’s College, Cambridge,
more complete than the preceding. A from 1931 to 1934, Turing was attracted to many
logic Lω may then be constructed in parts of mathematics, including mathematical logic.
which the provable theorems are the
totality of theorems provable with the 1 I have written about this at somewhat greater length in
help of the logics L, L1 , L2 , … Proceed- [10]; that material has also been incorporated as an in-
troductory note to Turing’s 1939 paper in the volume,
Solomon Feferman is emeritus professor of mathematics Mathematical Logic [25] of his collected works. In its bio-
and philosophy at Stanford University. His email address graphical part I drew to a considerable extent on Andrew
is [email protected]. Hodges’ superb biography, Alan Turing: The Enigma [16].