Switch to: Citations

Add references

You must login to add references.
  1. Mathematical logic.Joseph R. Shoenfield - 1967 - Reading, Mass.,: Addison-Wesley.
    8.3 The consistency proof -- 8.4 Applications of the consistency proof -- 8.5 Second-order arithmetic -- Problems -- Chapter 9: Set Theory -- 9.1 Axioms for sets -- 9.2 Development of set theory -- 9.3 Ordinals -- 9.4 Cardinals -- 9.5 Interpretations of set theory -- 9.6 Constructible sets -- 9.7 The axiom of constructibility -- 9.8 Forcing -- 9.9 The independence proofs -- 9.10 Large cardinals -- Problems -- Appendix The Word Problem -- Index.
    Download  
     
    Export citation  
     
    Bookmark   222 citations  
  • Theory of recursive functions and effective computability.Hartley Rogers - 1987 - Cambridge: MIT Press.
    Download  
     
    Export citation  
     
    Bookmark   479 citations  
  • The Fine Structure of Degrees of Unsolvability of Recursively Enumerable Sets.R. M. Friedberg - 1963 - Journal of Symbolic Logic 28 (2):166-166.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Recursive Function Theory and Logic.Ann Yasuhara - 1975 - Journal of Symbolic Logic 40 (4):619-620.
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • Enumerability, Decidability, Computability.H. Hermes - 1965
    Download  
     
    Export citation  
     
    Bookmark   13 citations  
  • Formal Languages.Arto Salomaa - 1977 - Journal of Symbolic Logic 42 (4):583-584.
    Download  
     
    Export citation  
     
    Bookmark   9 citations