Advertisement

Survey of Recursion Theory

  • J. Donald Monk
Part of the Graduate Texts in Mathematics book series (GTM, volume 37)

Abstract

We have developed recursion theory as much as we need for our later purposes in logic. But in this chapter we want to survey, without proofs, some further topics. Most of these topics are also frequently useful in logical investigations.

Keywords

Word Problem Turing Machine Initial Segment Recursive Function Diophantine Equation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  1. 1.
    Boone, W. W. The word problem. Ann. Math., 70 (1959), 207–265.MathSciNetMATHCrossRefGoogle Scholar
  2. 2.
    Davis, M. Hilbert’s tenth problem is unsolvable. Amer. Math. Monthly, 80 (1973), 233–269.MathSciNetMATHCrossRefGoogle Scholar
  3. 3.
    Dekker, J. C. E. Les Fonctions Combinatoires et les Isols. Paris: Gauthier-Villars (1966).MATHGoogle Scholar
  4. 4.
    Dekker, J. C. E. and Myhill, J. Recursive equivalence types. Univ. Calif. Publ. Math., 3 (1960), 67–214.MathSciNetGoogle Scholar
  5. 5.
    Hermes, H. Enumerability, Decidability, Computability. New York: Springer (1969).Google Scholar

Copyright information

© Springer-Verlag Inc. 1976

Authors and Affiliations

  • J. Donald Monk
    • 1
  1. 1.Department of MathematicsUniversity of ColoradoBoulderUSA

Personalised recommendations