Switch to: Citations

Add references

You must login to add references.
  1. Logic with denumerably long formulas and finite strings of quantifiers.Dana Scott - 1965 - Journal of Symbolic Logic 36 (1):1104--329.
    Direct download  
     
    Export citation  
     
    Bookmark   33 citations  
  • The α-finite injury method.G. E. Sacks & S. G. Simpson - 1972 - Annals of Mathematical Logic 4 (4):343-367.
  • The alpha-finite injury method.G. E. Sacks - 1972 - Annals of Mathematical Logic 4 (4):343.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   39 citations  
  • Scott sentences and admissible sets.Mark Nadel - 1974 - Annals of Mathematical Logic 7 (2):267.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   42 citations  
  • An example concerning Scott heights.M. Makkai - 1981 - Journal of Symbolic Logic 46 (2):301-318.
  • 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 (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   22 citations  
  • The alpha-finite injury method.G. E. Sacks - 1972 - Annals of Mathematical Logic 4 (4):343.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   25 citations