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  
  • 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  
  • 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  
  • 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  
  • On two questions concerning the automorphism groups of countable recursively saturated models of PA.Roman Kossak & Nicholas Bamber - 1996 - Archive for Mathematical Logic 36 (1):73-79.
    Download  
     
    Export citation  
     
    Bookmark   7 citations