Switch to: Citations

Add references

You must login to add references.
  1. Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.
    Download  
     
    Export citation  
     
    Bookmark   599 citations  
  • (2 other versions)Set Theory.Keith J. Devlin - 1981 - Journal of Symbolic Logic 46 (4):876-877.
    Download  
     
    Export citation  
     
    Bookmark   163 citations  
  • (1 other version)Completeness and Categoricity. Part I: Nineteenth-century Axiomatics to Twentieth-century Metalogic.Steve Awodey & Erich H. Reck - 2002 - History and Philosophy of Logic 23 (1):1-30.
    This paper is the first in a two-part series in which we discuss several notions of completeness for systems of mathematical axioms, with special focus on their interrelations and historical origins in the development of the axiomatic method. We argue that, both from historical and logical points of view, higher-order logic is an appropriate framework for considering such notions, and we consider some open questions in higher-order axiomatics. In addition, we indicate how one can fruitfully extend the usual set-theoretic semantics (...)
    Download  
     
    Export citation  
     
    Bookmark   53 citations  
  • Isomorphism and higher order equivalence.M. Ajtai - 1979 - Annals of Mathematical Logic 16 (3):181.
    Download  
     
    Export citation  
     
    Bookmark   9 citations