Switch to: Citations

Add references

You must login to add references.
  1. (1 other version)Recursive well-orderings.Clifford Spector - 1955 - Journal of Symbolic Logic 20 (2):151-163.
    Download  
     
    Export citation  
     
    Bookmark   36 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  
  • The Upper Semi-Lattice of Degrees of Recursive Unsolvability.S. C. Kleene & Emil L. Post - 1956 - Journal of Symbolic Logic 21 (4):407-408.
    Download  
     
    Export citation  
     
    Bookmark   13 citations  
  • A note on the hyperarithmetical hierarchy.H. B. Enderton & Hilary Putnam - 1970 - Journal of Symbolic Logic 35 (3):429-430.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Degrees of Unsolvability.Gerald E. Sacks - 1966 - Princeton University Press.
    A classic treatment of degrees of unsolvability from the acclaimed Annals of Mathematics Studies series Princeton University Press is proud to have published the Annals of Mathematics Studies since 1940. One of the oldest and most respected series in science publishing, it has included many of the most important and influential mathematical works of the twentieth century. The series continues this tradition as Princeton University Press publishes the major works of the twenty-first century. To mark the continued success of the (...)
    Download  
     
    Export citation  
     
    Bookmark   47 citations  
  • (1 other version)Distributive Initial Segments of the Degrees of Unsolvability.A. H. Lachlan - 1968 - Mathematical Logic Quarterly 14 (30):457-472.
    Download  
     
    Export citation  
     
    Bookmark   21 citations  
  • (1 other version)Review: Joseph Harrison, Recursive Pseudo-well-Orderings. [REVIEW]Yiannis N. Moschovakis - 1972 - Journal of Symbolic Logic 37 (1):197-198.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Uniformly introreducible sets.Carl G. Jockusch - 1968 - Journal of Symbolic Logic 33 (4):521-536.
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • (1 other version)Bar Induction and $Pi^1_1-CA^1$.Harvey Friedman - 1969 - Journal of Symbolic Logic 34 (3):353-362.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • (1 other version)A criterion for completeness of degrees of unsolvability.Richard Friedberg - 1957 - Journal of Symbolic Logic 22 (2):159-160.
    Download  
     
    Export citation  
     
    Bookmark   14 citations  
  • (1 other version)Distributive Initial Segments of the Degrees of Unsolvability.A. H. Lachlan - 1968 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 14 (30):457-472.
    Download  
     
    Export citation  
     
    Bookmark   21 citations  
  • Theory of recursive functions and effective computability.Hartley Rogers - 1987 - Cambridge: MIT Press.
    Download  
     
    Export citation  
     
    Bookmark   480 citations  
  • Proof of Mostowski's Conjecture.R. O. Gandy - 1964 - Journal of Symbolic Logic 29 (2):103-104.
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • Hyperarithmetical Quantifiers.C. Spector & Shih-Chao Liu - 1966 - Journal of Symbolic Logic 31 (1):137-137.
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • Degrees of unsolvability of constructible sets of integers.George Boolos & Hilary Putnam - 1968 - Journal of Symbolic Logic 33 (4):497-513.
    Download  
     
    Export citation  
     
    Bookmark   14 citations  
  • On Degrees of Recursive Unsolvability.Clifford Spector - 1957 - Journal of Symbolic Logic 22 (4):374-375.
    Download  
     
    Export citation  
     
    Bookmark   16 citations  
  • Constructively accessible ordinal numbers.Wayne Richter - 1968 - Journal of Symbolic Logic 33 (1):43-55.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • (1 other version)Review: S. C. Kleene, Quantification of Number-Theoretic Functions. [REVIEW]A. Nerode - 1962 - Journal of Symbolic Logic 27 (1):82-82.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • The Axiom of Choice and the Class of Hyperarithmetic Functions.G. Kreisel - 1970 - Journal of Symbolic Logic 35 (2):333-334.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Set Existence.R. O. Gandy, G. Kreisel & W. W. Tait - 1962 - Journal of Symbolic Logic 27 (2):232-233.
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • Bar induction and Π11-CA.Harvey Friedman - 1969 - Journal of Symbolic Logic 34 (3):353 - 362.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • (1 other version)Bar Induction and Π 1 1 -CA 1.Harvey Friedman - 1969 - Journal of Symbolic Logic 34 (3):353-362.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • (1 other version)Review: Georges Kreisel, La Predicativite. [REVIEW]Solomon Feferman - 1962 - Journal of Symbolic Logic 27 (1):79-80.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • (1 other version)Review: Azriel Levy, A Hierarchy of Formulas in Set Theory. [REVIEW]Solomon Feferman - 1968 - Journal of Symbolic Logic 33 (3):473-474.
    Download  
     
    Export citation  
     
    Bookmark   17 citations