English
Related papers

Related papers: On the set-generic multiverse

200 papers

We mechanize, in the proof assistant Isabelle, a proof of the axiom-scheme of Separation in generic extensions of models of set theory by using the fundamental theorems of forcing. We also formalize the satisfaction of the axioms of…

Logic in Computer Science · Computer Science 2019-01-11 Emmanuel Gunther , Miguel Pagano , Pedro Sánchez Terraf

The technique of symmetric extensions is derived from forcing and it is one of the most important tools for studying models without the Axiom of Choice. Despite being incredibly successful since the 1960s, our understanding of the technique…

Logic · Mathematics 2026-02-20 Asaf Karagila , Jonathan Schilhan

We formalize the theory of forcing in the set theory framework of Isabelle/ZF. Under the assumption of the existence of a countable transitive model of ZFC, we construct a proper generic extension and show that the latter also satisfies…

Logic in Computer Science · Computer Science 2020-04-21 Emmanuel Gunther , Miguel Pagano , Pedro Sánchez Terraf

We analyze the precise modal commitments of several natural varieties of set-theoretic potentialism, using tools we develop for a general model-theoretic account of potentialism, building on those of Hamkins, Leibman and L\"owe, including…

Logic · Mathematics 2018-08-07 Joel David Hamkins , Øystein Linnebo

In this paper, we present a proof of the consistency of the New Foundations set theory ($\mathit{NF}$). $\mathit{NF}$'s main idea is to permit very large sets (including the Universal Set) by restricting set formation to stratified…

Logic · Mathematics 2025-09-05 Nicolás Sevilla Simón

We discuss some highlights of our computer-verified proof of the construction, given a countable transitive set-model $M$ of $\mathit{ZFC}$, of generic extensions satisfying $\mathit{ZFC}+\neg\mathit{CH}$ and $\mathit{ZFC}+\mathit{CH}$.…

Hadwiger's theorem is a Helly-type theorem involving common transversals to families of convex sets instead of common intersections. Subsequently, Pollack and Wenger identified a necessary and sufficient condition, called a consistent…

Combinatorics · Mathematics 2025-12-03 Ilani Axelrod-Freed , João Pedro Carvalho , Yuki Takahashi

The main theorem of this article is that every countable model of set theory M, including every well-founded model, is isomorphic to a submodel of its own constructible universe. In other words, there is an embedding $j:M\to L^M$ that is…

Logic · Mathematics 2014-02-14 Joel David Hamkins

Every mathematical structure has an elementary extension to a pseudo-countable structure, one that is seen as countable inside a suitable class model of set theory, even though it may actually be uncountable. This observation, proved easily…

Logic · Mathematics 2022-10-11 Joel David Hamkins

We develop a general theory for class-sized symmetric systems as a natural extension of symmetric systems with respect to class forcing. In particular, adapting the usual notions of pretameness and tameness for class forcing, we present…

Logic · Mathematics 2026-04-01 Peter Holy , Emma Palmer , Jonathan Schilhan

Our original aim was, in Abelian group theory to prove the consistency of: lambda is strong limit singular and for some properties of abelian groups which are relatives of being free, the compactness in singular fails. In fact this should…

Logic · Mathematics 2013-06-25 Saharon Shelah

We bring forward a logical system of transition algebras that enhances many-sorted first-order logic using features from dynamic logics. The sentences we consider include compositions, unions, and transitive closures of transition…

Logic in Computer Science · Computer Science 2024-04-26 Hashimoto Go , Daniel Găină , Ionuţ Ţuţu

A new axiom is proposed, the Ground Axiom, asserting that the universe is not a nontrivial set-forcing extension of any inner model. The Ground Axiom is first-order expressible, and any model of ZFC has a class-forcing extension which…

Logic · Mathematics 2007-05-23 Jonas Reitz

What are the most general principles in set theory relating forceability and truth? As with Solovay's celebrated analysis of provability, both this question and its answer are naturally formulated with modal logic. We aim to do for…

Logic · Mathematics 2007-05-23 Joel David Hamkins , Benedikt Loewe

In this article we adapt the existing account of class-forcing over a ZFC model to a model $(M,\mathcal{C})$ of Morse-Kelley class theory. We give a rigorous definition of class-forcing in such a model and show that the Definability Lemma…

Logic · Mathematics 2015-03-03 Carolin Antos

A new axiom is proposed, the Ground Axiom, asserting that the universe is not a nontrivial set forcing extension of any inner model. The Ground Axiom is first-order expressible, and any model of ZFC has a class forcing extension which…

Logic · Mathematics 2007-05-23 Jonas Reitz

A forcing extension may create new isomorphisms between two models of a first order theory. Certain model theoretic constraints on the theory and other constraints on the forcing can prevent this pathology. A countable first order theory is…

Logic · Mathematics 2016-09-06 John T. Baldwin , Michael C. Laskowski , Saharon Shelah

These are lecture notes from a course I gave at the University of Wisconsin during the Spring semester of 1993. Part 1 is concerned with Borel hierarchies. Section 13 contains an unpublished theorem of Fremlin concerning Borel hierarchies…

Logic · Mathematics 2009-09-25 Arnold Miller

A transitive model $M$ of ZFC is called a ground if the universe $V$ is a set forcing extension of $M$. We show that the grounds of $V$ are downward set-directed. Consequently, we establish some fundamental theorems on the forcing method…

Logic · Mathematics 2018-07-23 Toshimichi Usuba

Motivated by problems involving end extensions of models of set theory, we develop the rudiments of the power admissible cover construction (over ill-founded models of set theory), an extension of the machinery of admissible covers invented…

Logic · Mathematics 2022-03-28 Zachiri McKenzie , Ali Enayat