Switch to: Citations

Add references

You must login to add references.
  1. (1 other version)The Priority Method I.A. H. Lachlans - 1967 - Mathematical Logic Quarterly 13 (1‐2):1-10.
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • (1 other version)The Priority Method I.A. H. Lachlans - 1967 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 13 (1-2):1-10.
    Download  
     
    Export citation  
     
    Bookmark   12 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  
  • (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  
  • (1 other version)Implicit definability and infinitary languages.Kenneth Kunen - 1968 - Journal of Symbolic Logic 33 (3):446-451.
    Download  
     
    Export citation  
     
    Bookmark   3 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  
  • 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 Consistency of the Continuum Hypothesis.Kurt Gödel - 1940 - Princeton University Press.
    Previously published: Princeton University Press, 1940.
    Download  
     
    Export citation  
     
    Bookmark   40 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  
  • Some minimal pairs of alpha-recursively enumerable degrees.Manuel Lerman - 1972 - Annals of Mathematical Logic 4 (4):415.
    Download  
     
    Export citation  
     
    Bookmark   19 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