Switch to: Citations

Add references

You must login to add references.
  1. Models and types of Peano's arithmetic.Haim Gaifman - 1976 - Annals of Mathematical Logic 9 (3):223-306.
    Download  
     
    Export citation  
     
    Bookmark   48 citations  
  • Ultrafilters and types on models of arithmetic.L. A. S. Kirby - 1984 - Annals of Pure and Applied Logic 27 (3):215-252.
    Download  
     
    Export citation  
     
    Bookmark   9 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  
  • Automorphisms of recursively saturated models of arithmetic.Richard Kaye, Roman Kossak & Henryk Kotlarski - 1991 - Annals of Pure and Applied Logic 55 (1):67-99.
    We give an examination of the automorphism group Aut of a countable recursively saturated model M of PA. The main result is a characterisation of strong elementary initial segments of M as the initial segments consisting of fixed points of automorphisms of M. As a corollary we prove that, for any consistent completion T of PA, there are recursively saturated countable models M1, M2 of T, such that Aut[ncong]Aut, as topological groups with a natural topology. Other results include a classification (...)
    Download  
     
    Export citation  
     
    Bookmark   32 citations  
  • Infinite substructure lattices of models of Peano Arithmetic.James H. Schmerl - 2010 - Journal of Symbolic Logic 75 (4):1366-1382.
    Bounded lattices (that is lattices that are both lower bounded and upper bounded) form a large class of lattices that include all distributive lattices, many nondistributive finite lattices such as the pentagon lattice N₅, and all lattices in any variety generated by a finite bounded lattice. Extending a theorem of Paris for distributive lattices, we prove that if L is an ℵ₀-algebraic bounded lattice, then every countable nonstandard model ������ of Peano Arithmetic has a cofinal elementary extension ������ such that (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Full satisfaction classes: a survey.Henryk Kotlarski - 1991 - Notre Dame Journal of Formal Logic 32 (4):573-579.
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • Minimal satisfaction classes with an application to rigid models of Peano arithmetic.Roman Kossak & James H. Schmerl - 1991 - Notre Dame Journal of Formal Logic 32 (3):392-398.
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • A note on initial segment constructions in recursively saturated models of arithmetic.C. Smoryński - 1982 - Notre Dame Journal of Formal Logic 23 (4):393-408.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Elementary extensions of recursively saturated models of arithmetic.C. Smoryński - 1981 - Notre Dame Journal of Formal Logic 22 (3):193-203.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • A certain class of models of peano arithmetic.Roman Kossak - 1983 - Journal of Symbolic Logic 48 (2):311-320.
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • 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  
  • Hanf numbers for omitting types over particular theories.Julia F. Knight - 1976 - Journal of Symbolic Logic 41 (3):583-588.
    Download  
     
    Export citation  
     
    Bookmark   5 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  
  • On maximal subgroups of the automorphism group of a countable recursively saturated model of PA.Roman Kossak, Henryk Kotlarski & James H. Schmerl - 1993 - Annals of Pure and Applied Logic 65 (2):125-148.
    We show that the stabilizer of an element a of a countable recursively saturated model of arithmetic M is a maximal subgroup of Aut iff the type of a is selective. This is a point of departure for a more detailed study of the relationship between pointwise and setwise stabilizers of certain subsets of M and the types of elements in those subsets. We also show that a complete type of PA is 2-indiscernible iff it is minimal in the sense (...)
    Download  
     
    Export citation  
     
    Bookmark   14 citations