[FOM] Kleene's T predicate

Daniel Schwartz schwartz at cs.fsu.edu
Tue May 24 07:44:49 EDT 2016

Thanks to Martin Davis for the historical clarification.  Since Turing's
famous paper on computability was published in 1936, it does seem unlikely
that Kleene would have known about it when he invented the "T" predicate (at
least one year earlier).

But this then still leaves open the question: what does the "T" stand for,
if anything?

--Dan Schwartz

Dr. Daniel G. Schwartz                            Office    850-644-5875
Dept. of Computer Science, MC 4530                CS Dept   850-644-4029
Florida State University                          Fax       850-644-0058
Tallahassee, FL 32306-4530                        schwartz at cs.fsu.edu
U.S.A.                                   http://www.cs.fsu.edu/~schwartz

Martin Davis <martin at eipye.com> wrote:

> Trying to find a connection with Turing is hopelessly anachronistic. The
> first version of the T predicate was introduced in Kleene's paper "General
> Recursive Functions of Natural Numbers" Mathematische Annalen vol.
> 112(1936) 727-742.
> A footnote reads: "Presented to the American Mathematical Society,
> September 1935." The paper refers to works by Ackermann, Péter, Gödel, and
> Skolem, but not Turing. 

More information about the FOM mailing list