Switch to: Citations

Add references

You must login to add references.
  1. (2 other versions)The alpha-finite injury method.G. E. Sacks - 1972 - Annals of Mathematical Logic 4 (4):343.
    Download  
     
    Export citation  
     
    Bookmark   39 citations  
  • Degrees of Unsolvability.Gerald E. Sacks - 1966 - Princeton University Press.
    The description for this book, Degrees of Unsolvability. (AM-55), Volume 55, will be forthcoming.
    Download  
     
    Export citation  
     
    Bookmark   47 citations  
  • (2 other versions)The alpha-finite injury method.G. E. Sacks - 1972 - Annals of Mathematical Logic 4 (4):343.
    Download  
     
    Export citation  
     
    Bookmark   25 citations  
  • (2 other versions)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  
  • (1 other version)Σn sets which are Δn-incomparable.Richard A. Shore - 1974 - Journal of Symbolic Logic 39 (2):295 - 304.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Two Recursively Enumerable Sets of Incomparable Degrees of Unsolvability.R. M. Friedberg - 1958 - Journal of Symbolic Logic 23 (2):225-226.
    Download  
     
    Export citation  
     
    Bookmark   22 citations  
  • (1 other version)Minimal α-degrees.Richard A. Shore - 1972 - Annals of Mathematical Logic 4 (4):393-414.
    Download  
     
    Export citation  
     
    Bookmark   9 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   270 citations  
  • Gerald E. Sacks. The recursively enumerable degrees are dense. Annals of mathematics, ser. 2 vol. 80 (1964), pp. 300–312. [REVIEW]Gerald E. Sacks - 1969 - Journal of Symbolic Logic 34 (2):294-295.
    Download  
     
    Export citation  
     
    Bookmark   38 citations  
  • (1 other version)Minimal alpha-degrees.Richard A. Shore - 1972 - Annals of Mathematical Logic 4 (4):393.
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • (1 other version)Review: A. A. Mucnik, Negative Answer to the Problem of Reducibility of the Theory of Algorithms. [REVIEW]Hartley Rogers - 1957 - Journal of Symbolic Logic 22 (2):218-219.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • (1 other version)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  
  • Metarecursively enumerable sets and their metadegrees.Graham C. Driscoll - 1968 - Journal of Symbolic Logic 33 (3):389-411.
    Download  
     
    Export citation  
     
    Bookmark   12 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  
  • Some minimal pairs of alpha-recursively enumerable degrees.Manuel Lerman - 1972 - Annals of Mathematical Logic 4 (4):415.
    Download  
     
    Export citation  
     
    Bookmark   19 citations