Switch to: Citations

Add references

You must login to add references.
  1. Axiomatizable theories with few axiomatizable extensions.D. A. Martin & M. B. Pour-El - 1970 - Journal of Symbolic Logic 35 (2):205-209.
    Download  
     
    Export citation  
     
    Bookmark   13 citations  
  • (1 other version)Three theorems on recursive enumeration. I. decomposition. II. maximal set. III. enumeration without duplication.Richard M. Friedberg - 1958 - Journal of Symbolic Logic 23 (3):309-316.
    Download  
     
    Export citation  
     
    Bookmark   43 citations  
  • (1 other version)Classes of Recursively Enumerable Sets and Degrees of Unsolvability.Donald A. Martin - 1966 - Mathematical Logic Quarterly 12 (1):295-310.
    Download  
     
    Export citation  
     
    Bookmark   88 citations  
  • (2 other versions)Some Reasons for Generalizing Recursion Theory.G. Kreisel, R. O. Gandy & C. E. M. Yates - 1975 - Journal of Symbolic Logic 40 (2):230-232.
    Download  
     
    Export citation  
     
    Bookmark   14 citations  
  • On suborderings of the alpha-recursively enumerable alpha-degrees.Manuel Lerman - 1972 - Annals of Mathematical Logic 4 (4):369.
    Download  
     
    Export citation  
     
    Bookmark   19 citations  
  • Admissible ordinals and lattices of alpha-r.e. sets.Michael Machtey - 1971 - Annals of Mathematical Logic 2 (4):379.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • (1 other version)Recursively Enumerable Sets and Retracting Functions.C. E. M. Yates - 1967 - Journal of Symbolic Logic 32 (3):394-394.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • (2 other versions)Problems in symbolic logic.John Myhill - 1956 - Journal of Symbolic Logic 21 (2):215-215.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • (1 other version)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  
  • Recursion, metarecursion, and inclusion.James C. Owings - 1967 - Journal of Symbolic Logic 32 (2):173-179.
    Download  
     
    Export citation  
     
    Bookmark   10 citations