Switch to: References

Add citations

You must login to add citations.
  1. Constant Regions in Models of Arithmetic.Tin Lok Wong - 2015 - Notre Dame Journal of Formal Logic 56 (4):603-624.
    This paper introduces a new theory of constant regions, which generalizes that of interstices, in nonstandard models of arithmetic. In particular, we show that two homogeneity notions introduced by Richard Kaye and the author, namely, constantness and pregenericity, are equivalent. This led to some new characterizations of generic cuts in terms of existential closedness.
    Download  
     
    Export citation  
     
    Bookmark  
  • Automorphisms of Countable Short Recursively Saturated Models of PA.Erez Shochat - 2008 - Notre Dame Journal of Formal Logic 49 (4):345-360.
    A model of Peano Arithmetic is short recursively saturated if it realizes all its bounded finitely realized recursive types. Short recursively saturated models of $\PA$ are exactly the elementary initial segments of recursively saturated models of $\PA$. In this paper, we survey and prove results on short recursively saturated models of $\PA$ and their automorphisms. In particular, we investigate a certain subgroup of the automorphism group of such models. This subgroup, denoted $G|_{M(a)}$, contains all the automorphisms of a countable short (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Interstitial and pseudo gaps in models of Peano Arithmetic.Ermek S. Nurkhaidarov - 2010 - Mathematical Logic Quarterly 56 (2):198-204.
    In this paper we study the automorphism groups of models of Peano Arithmetic. Kossak, Kotlarski, and Schmerl [9] shows that the stabilizer of an unbounded element a of a countable recursively saturated model of Peano Arithmetic M is a maximal subgroup of Aut if and only if the type of a is selective. We extend this result by showing that if M is a countable arithmetically saturated model of Peano Arithmetic, Ω ⊂ M is a very good interstice, and a (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Decoding in the automorphism group of a recursively saturated model of arithmetic.Ermek Nurkhaidarov - 2015 - Mathematical Logic Quarterly 61 (3):179-188.
    The main result of this paper partially answers a question raised in about the existence of countable just recursively saturated models of Peano Arithmetic with non‐isomorphic automorphism groups. We show the existence of infinitely many countable just recursively saturated models of Peano Arithmetic such that their automorphism groups are not topologically isomorphic. We also discuss maximal open subgroups of the automorphism group of a countable arithmetically saturated model of in a very good interstice.
    Download  
     
    Export citation  
     
    Bookmark  
  • Automorphism Groups of Arithmetically Saturated Models.Ermek S. Nurkhaidarov - 2006 - Journal of Symbolic Logic 71 (1):203 - 216.
    In this paper we study the automorphism groups of countable arithmetically saturated models of Peano Arithmetic. The automorphism groups of such structures form a rich class of permutation groups. When studying the automorphism group of a model, one is interested to what extent a model is recoverable from its automorphism group. Kossak-Schmerl [12] show that ifMis a countable, arithmetically saturated model of Peano Arithmetic, then Aut(M) codes SSy(M). Using that result they prove:Let M1. M2be countable arithmetically saturated models of Peano (...)
    Download  
     
    Export citation  
     
    Bookmark   7 citations