Switch to: Citations

Add references

You must login to add references.
  1. Models of Peano Arithmetic.Richard Kaye - 1991 - Clarendon Press.
    An introduction to the developments of nonstandard models. Beginning with Godel's incompleteness theorem, it covers the prime models, cofinal extensions, and extensions, Gaifman's construction of a definable type, Tennenbaum's theorem and Friedman's theorem on indicators, ending with a chapter on recursive saturation and resplendency.
    Download  
     
    Export citation  
     
    Bookmark   95 citations  
  • Recursively saturated $\omega_1$-like models of arithmetic.Roman Kossak - 1985 - Notre Dame Journal of Formal Logic 26 (4):413-422.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Recursively saturated models generated by indiscernibles.James H. Schmerl - 1985 - Notre Dame Journal of Formal Logic 26 (2):99-105.
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • Admissible sets and structures: an approach to definability theory.Jon Barwise - 1975 - New York: Springer Verlag.
    Download  
     
    Export citation  
     
    Bookmark   101 citations  
  • Recursively saturated nonstandard models of arithmetic.C. Smoryński - 1981 - Journal of Symbolic Logic 46 (2):259-286.
    Download  
     
    Export citation  
     
    Bookmark   19 citations  
  • Toward model theory through recursive saturation.John Stewart Schlipf - 1978 - Journal of Symbolic Logic 43 (2):183-206.
    Download  
     
    Export citation  
     
    Bookmark   19 citations  
  • Some remarks on initial segments in models of peano arithmetic.Henryk Kotlarski - 1984 - Journal of Symbolic Logic 49 (3):955-960.
    If $M \models PA (= Peano Arithmetic)$ , we set $A^M = \{N \subset_e M: N \models PA\}$ and study this family.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • On cofinal extensions of models of arithmetic.Henryk Kotlarski - 1983 - Journal of Symbolic Logic 48 (2):253-262.
    We study cofinal extensions of models of arithmetic, in particular we show that some properties near to expandability are preserved under cofinal extensions.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • (1 other version)Models with the ω-property.Roman Kossak - 1989 - Journal of Symbolic Logic 54 (1):177-189.
    A model M of PA has the omega-property if it has a subset of order type omega that is coded in an elementary end extension of M. All countable recursively saturated models have the omega-property, but there are also models with the omega-property that are not recursively saturated. The papers is devoted to the study of structural properties of such models.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Initial Segments of Models of Peano's Axioms.L. A. S. Kirby, J. B. Paris, A. Lachlan, M. Srebrny & A. Zarach - 1983 - Journal of Symbolic Logic 48 (2):482-483.
    Download  
     
    Export citation  
     
    Bookmark   19 citations  
  • Ω1-like recursively saturated models of Presburger's arithmetic.Victor Harnik - 1986 - Journal of Symbolic Logic 51 (2):421-429.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Discernible elements in models for peano arithmetic.Andrzej Ehrenfeucht - 1973 - Journal of Symbolic Logic 38 (2):291-292.
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • A Note on Real Subsets of A Recursively Saturated Model.Athanassios Tzouvaras - 1991 - Mathematical Logic Quarterly 37 (13-16):207-216.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • (1 other version)Models and types of Peano's arithmetic.Haim Gaifman - 1976 - Annals of Mathematical Logic 9 (3):223-306.
    Download  
     
    Export citation  
     
    Bookmark   48 citations