Switch to: Citations

Add references

You must login to add references.
  1. Elementary Induction on Abstract Structures.Wayne Richter - 1979 - Journal of Symbolic Logic 44 (1):124-125.
    Download  
     
    Export citation  
     
    Bookmark   64 citations  
  • 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  
  • Mathematical Logic.Donald Monk - 1975 - Journal of Symbolic Logic 40 (2):234-236.
    Download  
     
    Export citation  
     
    Bookmark   102 citations  
  • Theory of recursive functions and effective computability.Hartley Rogers - 1987 - Cambridge: MIT Press.
    Download  
     
    Export citation  
     
    Bookmark   479 citations  
  • Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.
    Download  
     
    Export citation  
     
    Bookmark   597 citations  
  • Elementary induction on abstract structures.Yiannis Nicholas Moschovakis - 1974 - Mineola, N.Y.: Dover Publications.
    Hailed by the Bulletin of the American Mathematical Society as "easy to use and a pleasure to read," this research monograph is recommended for students and professionals interested in model theory and definability theory. The sole prerequisite is a familiarity with the basics of logic, model theory, and set theory. 1974 edition.
    Download  
     
    Export citation  
     
    Bookmark   81 citations