Switch to: References

Add citations

You must login to add citations.
  1. 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  
  • (1 other version)Inductive Full Satisfaction Classes.Henryk Kotlarski & Zygmunt Ratajczyk - 1990 - Annals of Pure and Applied Logic 47 (1):199--223.
    Download  
     
    Export citation  
     
    Bookmark   15 citations  
  • Recursive Functions and Metamathematics: Problems of Completeness and Decidability, Gödel's Theorems.Rod J. L. Adams & Roman Murawski - 1999 - Dordrecht, Netherland: Springer Verlag.
    Traces the development of recursive functions from their origins in the late nineteenth century to the mid-1930s, with particular emphasis on the work and influence of Kurt Gödel.
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • (1 other version)Models with the ω-property.Roman Kossak - 1989 - Journal of Symbolic Logic 54 (1):177-189.
    A model M of PA has the omega-property if it has a subset of order type omega that is coded in an elementary end extension of M. All countable recursively saturated models have the omega-property, but there are also models with the omega-property that are not recursively saturated. The papers is devoted to the study of structural properties of such models.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Full Satisfaction Classes, Definability, and Automorphisms.Bartosz Wcisło - 2022 - Notre Dame Journal of Formal Logic 63 (2):143-163.
    We show that for every countable recursively saturated model M of Peano arithmetic and every subset A⊆M, there exists a full satisfaction class SA⊆M2 such that A is definable in (M,SA) without parameters. It follows that in every such model, there exists a full satisfaction class which makes every element definable, and thus the expanded model is minimal and rigid. On the other hand, as observed by Roman Kossak, for every full satisfaction class S there are two elements which have (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • (1 other version)A note on the variety of satisfaction classes.Roman Murawski - 1990 - Archive for Mathematical Logic 30 (2):83-89.
    Download  
     
    Export citation  
     
    Bookmark  
  • (1 other version)Inductive full satisfaction classes.H. Kotlarski - 1990 - Annals of Pure and Applied Logic 47 (3):199.
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • 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