Recursive Functions and Metamathematics: Problems of Completeness and Decidability, Gödel's Theorems

Dordrecht, Netherland: Springer Verlag (1999)
  Copy   BIBTEX

Abstract

Traces the development of recursive functions from their origins in the late nineteenth century to the mid-1930s, with particular emphasis on the work and influence of Kurt Gödel.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 94,549

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

An elementary system as and its semi‐completeness and decidability.Qin Jun - 1992 - Mathematical Logic Quarterly 38 (1):305-320.
Computability and Logic.George Boolos, John Burgess, Richard P. & C. Jeffrey - 1980 - New York: Cambridge University Press. Edited by John P. Burgess & Richard C. Jeffrey.

Analytics

Added to PP
2015-02-13

Downloads
26 (#611,308)

6 months
15 (#236,726)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

References found in this work

The emperor’s new mind.Roger Penrose - 1989 - Oxford University Press.
Computing machinery and intelligence.Alan M. Turing - 1950 - Mind 59 (October):433-60.
Remarks on the foundations of mathematics.Ludwig Wittgenstein - 1956 - Oxford [Eng.]: Blackwell. Edited by G. E. M. Anscombe, Rush Rhees & G. H. von Wright.
On Computable Numbers, with an Application to the Entscheidungsproblem.Alan Turing - 1936 - Proceedings of the London Mathematical Society 42 (1):230-265.

View all 174 references / Add more references