Switch to: References

Add citations

You must login to add citations.
  1. Truth in generic cuts.Richard Kaye & Tin Lok Wong - 2010 - Annals of Pure and Applied Logic 161 (8):987-1005.
    In an earlier paper the first author initiated the study of generic cuts of a model of Peano arithmetic relative to a notion of an indicator in the model. This paper extends that work. We generalise the idea of an indicator to a related neighbourhood system; this allows the theory to be extended to one that includes the case of elementary cuts. Most results transfer to this more general context, and in particular we obtain the idea of a generic cut (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • On Cofinal Submodels and Elementary Interstices.Roman Kossak & James H. Schmerl - 2012 - Notre Dame Journal of Formal Logic 53 (3):267-287.
    We prove a number of results concerning the variety of first-order theories and isomorphism types of pairs of the form $(N,M)$ , where $N$ is a countable recursively saturated model of Peano Arithmetic and $M$ is its cofinal submodel. We identify two new isomorphism invariants for such pairs. In the strongest result we obtain continuum many theories of such pairs with the fixed greatest common initial segment of $N$ and $M$ and fixed lattice of interstructures $K$ , such that $M\prec (...)
    Download  
     
    Export citation  
     
    Bookmark   2 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  
  • Four Problems Concerning Recursively Saturated Models of Arithmetic.Roman Kossak - 1995 - Notre Dame Journal of Formal Logic 36 (4):519-530.
    The paper presents four open problems concerning recursively saturated models of Peano Arithmetic. One problems concerns a possible converse to Tarski's undefinability of truth theorem. The other concern elementary cuts in countable recursively saturated models, extending automorphisms of countable recursively saturated models, and Jonsson models of PA. Some partial answers are given.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • On Automorphisms of Resplendent Models of Arithmetic.Zofia Seremet - 1984 - Mathematical Logic Quarterly 30 (19-24):349-352.
    Download  
     
    Export citation  
     
    Bookmark  
  • Elementary Cuts in Saturated Models of Peano Arithmetic.James H. Schmerl - 2012 - Notre Dame Journal of Formal Logic 53 (1):1-13.
    A model $\mathscr{M} = (M,+,\times, 0,1,<)$ of Peano Arithmetic $({\sf PA})$ is boundedly saturated if and only if it has a saturated elementary end extension $\mathscr{N}$. The ordertypes of boundedly saturated models of $({\sf PA})$ are characterized and the number of models having these ordertypes is determined. Pairs $(\mathscr{N},M)$, where $\mathscr{M} \prec_{\sf end} \mathscr{N} \models({\sf PA})$ for saturated $\mathscr{N}$, and their theories are investigated. One result is: If $\mathscr{N}$ is a $\kappa$-saturated model of $({\sf PA})$ and $\mathscr{M}_0, \mathscr{M}_1 \prec_{\sf end} (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations