Switch to: References

Add citations

You must login to add citations.
  1. On Keisler singular‐like models.Shahram Mohsenipour - 2008 - Mathematical Logic Quarterly 54 (3):330-336.
    Keisler in [7] proved that for a strong limit cardinal κ and a singular cardinal λ, the transfer relation κ → λ holds. We analyze the λ -like models produced in the proof of Keisler's transfer theorem when κ is further assumed to be regular. Our main result shows that with this extra assumption, Keisler's proof can be modified to produce a λ -like model M with built-in Skolem functions that satisfies the following two properties: M is generated by a (...)
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Rank-initial embeddings of non-standard models of set theory.Paul Kindvall Gorbow - 2020 - Archive for Mathematical Logic 59 (5-6):517-563.
    A theoretical development is carried to establish fundamental results about rank-initial embeddings and automorphisms of countable non-standard models of set theory, with a keen eye for their sets of fixed points. These results are then combined into a “geometric technique” used to prove several results about countable non-standard models of set theory. In particular, back-and-forth constructions are carried out to establish various generalizations and refinements of Friedman’s theorem on the existence of rank-initial embeddings between countable non-standard models of the fragment (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  • Model theory of the regularity and reflection schemes.Ali Enayat & Shahram Mohsenipour - 2008 - Archive for Mathematical Logic 47 (5):447-464.
    This paper develops the model theory of ordered structures that satisfy Keisler’s regularity scheme and its strengthening REF ${(\mathcal{L})}$ (the reflection scheme) which is an analogue of the reflection principle of Zermelo-Fraenkel set theory. Here ${\mathcal{L}}$ is a language with a distinguished linear order <, and REF ${(\mathcal {L})}$ consists of formulas of the form $$\exists x \forall y_{1} < x \ldots \forall y_{n} < x \varphi (y_{1},\ldots ,y_{n})\leftrightarrow \varphi^{ < x}(y_1, \ldots ,y_n),$$ where φ is an ${\mathcal{L}}$ -formula, φ (...))
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   2 citations