Switch to: References

Add citations

You must login to add citations.
  1. Modal Model Theory.Joel David Hamkins & Wojciech Aleksander Wołoszyn - 2024 - Notre Dame Journal of Formal Logic 65 (1):1-37.
    We introduce the subject of modal model theory, where one studies a mathematical structure within a class of similar structures under an extension concept that gives rise to mathematically natural notions of possibility and necessity. A statement φ is possible in a structure (written φ) if φ is true in some extension of that structure, and φ is necessary (written φ) if it is true in all extensions of the structure. A principal case for us will be the class Mod(T) (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • The weakly compact reflection principle need not imply a high order of weak compactness.Brent Cody & Hiroshi Sakai - 2020 - Archive for Mathematical Logic 59 (1-2):179-196.
    The weakly compact reflection principle\\) states that \ is a weakly compact cardinal and every weakly compact subset of \ has a weakly compact proper initial segment. The weakly compact reflection principle at \ implies that \ is an \-weakly compact cardinal. In this article we show that the weakly compact reflection principle does not imply that \ is \\)-weakly compact. Moreover, we show that if the weakly compact reflection principle holds at \ then there is a forcing extension preserving (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Taming Koepke's Zoo II: Register machines.Merlin Carl - 2022 - Annals of Pure and Applied Logic 173 (3):103041.
    Download  
     
    Export citation  
     
    Bookmark  
  • Independence Results for Finite Set Theories in Well-Founded Locally Finite Graphs.Funmilola Balogun & Benedikt Löwe - forthcoming - Studia Logica:1-20.
    We consider all combinatorially possible systems corresponding to subsets of finite set theory (i.e., Zermelo-Fraenkel set theory without the axiom of infinity) and for each of them either provide a well-founded locally finite graph that is a model of that theory or show that this is impossible. To that end, we develop the technique of axiom closure of graphs.
    Download  
     
    Export citation  
     
    Bookmark  
  • Hyperclass forcing in Morse-Kelley class theory.Carolin Antos & Sy-David Friedman - 2017 - Journal of Symbolic Logic 82 (2):549-575.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • A good lightface Δ n 1 well-ordering of the reals does not imply the existence of boldface Δ n − 1 1 well-orderings.Vladimir Kanovei & Vassily Lyubetsky - 2024 - Annals of Pure and Applied Logic 175 (6):103426.
    Download  
     
    Export citation  
     
    Bookmark  
  • What Model Companionship Can Say About the Continuum Problem.Giorgio Venturi & Matteo Viale - forthcoming - Review of Symbolic Logic:1-40.
    We present recent results on the model companions of set theory, placing them in the context of a current debate in the philosophy of mathematics. We start by describing the dependence of the notion of model companionship on the signature, and then we analyze this dependence in the specific case of set theory. We argue that the most natural model companions of set theory describe (as the signature in which we axiomatize set theory varies) theories of $H_{\kappa ^+}$, as $\kappa (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Class forcing, the forcing theorem and Boolean completions.Peter Holy, Regula Krapf, Philipp Lücke, Ana Njegomir & Philipp Schlicht - 2016 - Journal of Symbolic Logic 81 (4):1500-1530.
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • The σ1-definable universal finite sequence.Joel David Hamkins & Kameryn J. Williams - 2022 - Journal of Symbolic Logic 87 (2):783-801.
    We introduce the $\Sigma _1$ -definable universal finite sequence and prove that it exhibits the universal extension property amongst the countable models of set theory under end-extension. That is, the sequence is $\Sigma _1$ -definable and provably finite; the sequence is empty in transitive models; and if M is a countable model of set theory in which the sequence is s and t is any finite extension of s in this model, then there is an end-extension of M to a (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Strongly uplifting cardinals and the boldface resurrection axioms.Joel David Hamkins & Thomas A. Johnstone - 2017 - Archive for Mathematical Logic 56 (7-8):1115-1133.
    We introduce the strongly uplifting cardinals, which are equivalently characterized, we prove, as the superstrongly unfoldable cardinals and also as the almost-hugely unfoldable cardinals, and we show that their existence is equiconsistent over ZFC with natural instances of the boldface resurrection axiom, such as the boldface resurrection axiom for proper forcing.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Set-theoretic blockchains.Miha E. Habič, Joel David Hamkins, Lukas Daniel Klausner, Jonathan Verner & Kameryn J. Williams - 2019 - Archive for Mathematical Logic 58 (7-8):965-997.
    Given a countable model of set theory, we study the structure of its generic multiverse, the collection of its forcing extensions and ground models, ordered by inclusion. Mostowski showed that any finite poset embeds into the generic multiverse while preserving the nonexistence of upper bounds. We obtain several improvements of his result, using what we call the blockchain construction to build generic objects with varying degrees of mutual genericity. The method accommodates certain infinite posets, and we can realize these embeddings (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Indestructibility properties of Ramsey and Ramsey-like cardinals.Victoria Gitman & Thomas A. Johnstone - 2022 - Annals of Pure and Applied Logic 173 (6):103106.
    Download  
     
    Export citation  
     
    Bookmark  
  • Bi-interpretation in weak set theories.Alfredo Roque Freire & Joel David Hamkins - 2021 - Journal of Symbolic Logic 86 (2):609-634.
    In contrast to the robust mutual interpretability phenomenon in set theory, Ali Enayat proved that bi-interpretation is absent: distinct theories extending ZF are never bi-interpretable and models of ZF are bi-interpretable only when they are isomorphic. Nevertheless, for natural weaker set theories, we prove, including Zermelo–Fraenkel set theory $\mathrm {ZFC}^{-}$ without power set and Zermelo set theory Z, there are nontrivial instances of bi-interpretation. Specifically, there are well-founded models of $\mathrm {ZFC}^{-}$ that are bi-interpretable, but not isomorphic—even $\langle H_{\omega _1},\in (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Initial self-embeddings of models of set theory.Ali Enayat & Zachiri Mckenzie - 2021 - Journal of Symbolic Logic 86 (4):1584-1611.
    By a classical theorem of Harvey Friedman, every countable nonstandard model $\mathcal {M}$ of a sufficiently strong fragment of ZF has a proper rank-initial self-embedding j, i.e., j is a self-embedding of $\mathcal {M}$ such that $j[\mathcal {M}]\subsetneq \mathcal {M}$, and the ordinal rank of each member of $j[\mathcal {M}]$ is less than the ordinal rank of each element of $\mathcal {M}\setminus j[\mathcal {M}]$. Here, we investigate the larger family of proper initial-embeddings j of models $\mathcal {M}$ of fragments of (...)
    Download  
     
    Export citation  
     
    Bookmark