Switch to: References

Add citations

You must login to add citations.
  1. 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  
  • Extending models of arithmetic.James H. Schmerl - 1978 - Annals of Mathematical Logic 14 (2):89.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • 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  
  • Lower Bounds of Sets of P-points.Borisa Kuzeljevic, Dilip Raghavan & Jonathan L. Verner - 2023 - Notre Dame Journal of Formal Logic 64 (3):317-327.
    We show that MAκ implies that each collection of Pc-points of size at most κ which has a Pc-point as an RK upper bound also has a Pc-point as an RK lower bound.
    Download  
     
    Export citation  
     
    Bookmark  
  • Ultrafilters over a measurable cardinal.A. Kanamori - 1976 - Annals of Mathematical Logic 10 (3-4):315-356.
    Download  
     
    Export citation  
     
    Bookmark   15 citations