Switch to: Citations

Add references

You must login to add references.
  1. Lattice Theory.Garrett Birkhoff - 1940 - Journal of Symbolic Logic 5 (4):155-157.
    Download  
     
    Export citation  
     
    Bookmark   194 citations  
  • Review: A. H. Lachlan, Lower Bounds for Pairs of Recursively Enumerable Degrees. [REVIEW]Carl G. Jockusch - 1972 - Journal of Symbolic Logic 37 (3):611-611.
    Download  
     
    Export citation  
     
    Bookmark   29 citations  
  • 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  
  • 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