Switch to: Citations

Add references

You must login to add references.
  1. Introduction to metamathematics.Stephen Cole Kleene - 1952 - Groningen: P. Noordhoff N.V..
    Stephen Cole Kleene was one of the greatest logicians of the twentieth century and this book is the influential textbook he wrote to teach the subject to the next generation. It was first published in 1952, some twenty years after the publication of Godel's paper on the incompleteness of arithmetic, which marked, if not the beginning of modern logic. The 1930s was a time of creativity and ferment in the subject, when the notion of computable moved from the realm of (...)
    Download  
     
    Export citation  
     
    Bookmark   549 citations  
  • (1 other version)Introduction to mathematical logic.Elliott Mendelson - 1964 - Princeton, N.J.,: Van Nostrand.
    The Fourth Edition of this long-established text retains all the key features of the previous editions, covering the basic topics of a solid first course in ...
    Download  
     
    Export citation  
     
    Bookmark   188 citations  
  • Subrecursion: functions and hierarchies.H. E. Rose - 1984 - New York: Oxford University Press.
    Download  
     
    Export citation  
     
    Bookmark   35 citations  
  • Computability, Complexity and Languages.Martin Davies, Ron Segal & Elaine Weyuker - 1994 - Academic Press.
    Download  
     
    Export citation  
     
    Bookmark   23 citations  
  • Algebraic recursion theory.Ljubomir Lalov Ivanov - 1986 - New York: Halsted Press.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • (2 other versions)Set theory.Thomas Jech - 1981 - Journal of Symbolic Logic.
    Download  
     
    Export citation  
     
    Bookmark   120 citations  
  • Theory of Formal Systems.Raymond M. Smullyan - 1965 - Journal of Symbolic Logic 30 (1):88-90.
    Download  
     
    Export citation  
     
    Bookmark   55 citations  
  • Degrees of unsolvability.Joseph Robert Shoenfield - 1971 - New York,: American Elsevier.
    Download  
     
    Export citation  
     
    Bookmark   15 citations  
  • Theory of recursive functions and effective computability.Hartley Rogers - 1987 - Cambridge: MIT Press.
    Download  
     
    Export citation  
     
    Bookmark   480 citations  
  • (2 other versions)Degrees of Unsolvability.Leonard P. Sasso - 1975 - Journal of Symbolic Logic 40 (3):452-453.
    Download  
     
    Export citation  
     
    Bookmark   20 citations  
  • An Introduction to the General Theory of Algorithms.Michael Machtey & Paul Young - 1981 - Journal of Symbolic Logic 46 (4):877-878.
    Download  
     
    Export citation  
     
    Bookmark   33 citations