Switch to: Citations

Add references

You must login to add references.
  1. Simplicity of recursively enumerable sets.Robert W. Robinson - 1967 - Journal of Symbolic Logic 32 (2):162-172.
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • (1 other version)A theorem on hyperhypersimple sets.Donald A. Martin - 1963 - Journal of Symbolic Logic 28 (4):273-278.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Recursion, metarecursion, and inclusion.James C. Owings - 1967 - Journal of Symbolic Logic 32 (2):173-179.
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • 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   546 citations  
  • A theorem on maximal sets.Joseph S. Ullian - 1961 - Notre Dame Journal of Formal Logic 2 (4):222-223.
    Download  
     
    Export citation  
     
    Bookmark   2 citations