Switch to: References

Add citations

You must login to add citations.
  1. 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  
  • Saturation and simple extensions of models of peano arithmetic.Matt Kaufmann & James H. Schmerl - 1984 - Annals of Pure and Applied Logic 27 (2):109-136.
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • Largest initial segments pointwise fixed by automorphisms of models of set theory.Ali Enayat, Matt Kaufmann & Zachiri McKenzie - 2018 - Archive for Mathematical Logic 57 (1-2):91-139.
    Given a model \ of set theory, and a nontrivial automorphism j of \, let \\) be the submodel of \ whose universe consists of elements m of \ such that \=x\) for every x in the transitive closure of m ). Here we study the class \ of structures of the form \\), where the ambient model \ satisfies a frugal yet robust fragment of \ known as \, and \=m\) whenever m is a finite ordinal in the sense (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations