Switch to: Citations

Add references

You must login to add references.
  1. Automorphisms of Saturated and Boundedly Saturated Models of Arithmetic.Ermek S. Nurkhaidarov & Erez Shochat - 2011 - Notre Dame Journal of Formal Logic 52 (3):315-329.
    We discuss automorphisms of saturated models of PA and boundedly saturated models of PA. We show that SmoryƄski's Lemma and Kaye's Theorem are not only true for countable recursively saturated models of PA but also true for all boundedly saturated models of PA with slight modifications.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Closed Normal Subgroups of the Automorphism Group of a Saturated Model of Peano Arithmetic.Ermek S. Nurkhaidarov & Erez Shochat - 2016 - Notre Dame Journal of Formal Logic 57 (1):127-139.
    In this paper we discuss automorphism groups of saturated models and boundedly saturated models of $\mathsf{PA}$. We show that there are saturated models of $\mathsf{PA}$ of the same cardinality with nonisomorphic automorphism groups. We then show that every saturated model of $\mathsf{PA}$ has short saturated elementary cuts with nonisomorphic automorphism groups.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Arithmetically Saturated Models of Arithmetic.Roman Kossak & James H. Schmerl - 1995 - Notre Dame Journal of Formal Logic 36 (4):531-546.
    The paper presents an outline of the general theory of countable arithmetically saturated models of PA and some of its applications. We consider questions concerning the automorphism group of a countable recursively saturated model of PA. We prove new results concerning fixed point sets, open subgroups, and the cofinality of the automorphism group. We also prove that the standard system of a countable arithmetically saturated model of PA is determined by the lattice of its elementary substructures.
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • (1 other version)Classical Recursion Theory.Peter G. Hinman - 2001 - Bulletin of Symbolic Logic 7 (1):71-73.
    Download  
     
    Export citation  
     
    Bookmark   70 citations  
  • On interstices of countable arithmetically saturated models of Peano arithmetic.Nicholas Bamber & Henryk Kotlarski - 1997 - Mathematical Logic Quarterly 43 (4):525-540.
    We give some information about the action of Aut on M, where M is a countable arithmetically saturated model of Peano Arithmetic. We concentrate on analogues of moving gaps and covering gaps inside M.
    Download  
     
    Export citation  
     
    Bookmark   14 citations  
  • Automorphisms of Models of True Arithmetic: Recognizing Some Basic Open Subgroups.Henryk Kotlarski & Richard Kaye - 1994 - Notre Dame Journal of Formal Logic 35 (1):1-14.
    Let M be a countable recursively saturated model of Th(), and let GAut(M), considered as a topological group. We examine connections between initial segments of M and subgroups of G. In particular, for each of the following classes of subgroups HG, we give characterizations of the class of terms of the topological group structure of H as a subgroup of G. (a) for some (b) for some (c) for some (d) for some (Here, M(a) denotes the smallest M containing a, (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations