Switch to: Citations

Add references

You must login to add references.
  1. Theory of recursive functions and effective computability.Hartley Rogers - 1987 - Cambridge: MIT Press.
    Download  
     
    Export citation  
     
    Bookmark   482 citations  
  • The α-finite injury method.G. E. Sacks & S. G. Simpson - 1972 - Annals of Mathematical Logic 4 (4):343-367.
    Download  
     
    Export citation  
     
    Bookmark   39 citations  
  • The alpha-finite injury method.G. E. Sacks - 1972 - Annals of Mathematical Logic 4 (4):343.
    Download  
     
    Export citation  
     
    Bookmark   39 citations  
  • Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.
    Download  
     
    Export citation  
     
    Bookmark   592 citations  
  • Recursive Functionals and Quantifiers of Finite Types I.A. Nerode - 1962 - Journal of Symbolic Logic 27 (1):82-83.
    Download  
     
    Export citation  
     
    Bookmark   19 citations  
  • Recursively Enumerable Sets of Positive Integers and Their Decision Problems.Emil L. Post - 1945 - Journal of Symbolic Logic 10 (1):18-19.
    Download  
     
    Export citation  
     
    Bookmark   44 citations  
  • The uniform regular set theorem in α-recursion theory.Wolfgang Maass - 1978 - Journal of Symbolic Logic 43 (2):270-279.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • On alpha- and beta-recursively enumerable degrees.Wolfgang Maass - 1979 - Annals of Mathematical Logic 16 (3):205.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • On minimal pairs and minimal degrees in higher recursion theory.Wolfgang Maass - 1977 - Archive for Mathematical Logic 18 (1):169-186.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Inadmissibility, tame R.E. sets and the admissible collapse.Wolfgang Maass - 1978 - Annals of Mathematical Logic 13 (2):149-170.
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • Inadmissibility, tame r.e. sets and the admissible collapse.Wolfgang Maass - 1978 - Annals of Mathematical Logic 13 (2):149.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Implicit definability and infinitary languages.Kenneth Kunen - 1968 - Journal of Symbolic Logic 33 (3):446-451.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Metarecursive sets.G. Kreisel & Gerald E. Sacks - 1965 - Journal of Symbolic Logic 30 (3):318-338.
    Our ultimate purpose is to give an axiomatic treatment of recursion theory sufficient to develop the priority method. The direct or abstract approach is to keep in mind as clearly as possible the methods actually used in recursion theory, and then to formulate them explicitly. The indirect or experimental approach is to look first for other mathematical theories which seem similar to recursion theory, to formulate the analogies precisely, and then to search for an axiomatic treatment which covers not only (...)
    Download  
     
    Export citation  
     
    Bookmark   22 citations  
  • The fine structure of the constructible hierarchy.R. Björn Jensen - 1972 - Annals of Mathematical Logic 4 (3):229.
    Download  
     
    Export citation  
     
    Bookmark   269 citations  
  • Two splitting theorems for beta-recursion theory.Steven Homer - 1980 - Annals of Mathematical Logic 18 (2):137.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Metarecursively enumerable sets and their metadegrees.Graham C. Driscoll - 1968 - Journal of Symbolic Logic 33 (3):389-411.
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • The alpha-finite injury method.G. E. Sacks - 1972 - Annals of Mathematical Logic 4 (4):343.
    Download  
     
    Export citation  
     
    Bookmark   25 citations  
  • Constructibility.Keith J. Devlin - 1987 - Journal of Symbolic Logic 52 (3):864-867.
    Download  
     
    Export citation  
     
    Bookmark   45 citations  
  • Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I.K. Gödel - 1931 - Monatshefte für Mathematik 38 (1):173--198.
    Download  
     
    Export citation  
     
    Bookmark   248 citations