English
Related papers

Related papers: Sufficient conditions for the forcing theorem, and…

200 papers

A new notion of independence relation is given and associated to it, the class of flat theories, a subclass of strong stable theories including the superstable ones is introduced. More precisely, after introducing this independence…

Logic · Mathematics 2018-04-18 Daniel Palacín , Saharon Shelah

If T has only countably many complete types, yet has a type of infinite multiplicity then there is a ccc forcing notion Q such that, in any Q --generic extension of the universe, there are non-isomorphic models M_1 and M_2 of T that can be…

Logic · Mathematics 2007-05-23 Michael C. Laskowski , Saharon Shelah

We describe a formalization of forcing using Boolean-valued models in the Lean 3 theorem prover, including the fundamental theorem of forcing and a deep embedding of first-order logic with a Boolean-valued soundness theorem. As an…

Logic in Computer Science · Computer Science 2019-04-25 Jesse Michael Han , Floris van Doorn

We present a general framework for forcing on $\omega_2$ with finite conditions using countable models as side conditions. This framework is based on a method of comparing countable models as being membership related up to a large initial…

Logic · Mathematics 2016-06-10 John Krueger

We consider deformations of bounded complexes of modules for a profinite group G over a field of positive characteristic. We prove a finiteness theorem which provides some sufficient conditions for the versal deformation of such a complex…

Number Theory · Mathematics 2013-09-03 Frauke M. Bleher , Ted Chinburg

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

Let V be the universe of sets and V_{\alpha} the sets of rank \leq\alpha. We develop some axiom schemata for set theory based on the following three assumptions: 1. V \models ZFC 2. V is large with respect to the class of ordinals 3. V is…

Logic · Mathematics 2016-09-06 Garvin Melles

In this article we present a technique for selecting models of set theory that are complete in a model-theoretic sense. Specifically, we will apply Robinson infinite forcing to the collections of models of ZFC obtained by Cohen forcing.…

Logic · Mathematics 2019-03-26 Giorgio Venturi

While numerous extensions of Banach's fixed point theorem typically offer only sufficient conditions for the existence and uniqueness of a fixed point and the convergence of iterative sequences, this study introduces a generalization…

Functional Analysis · Mathematics 2026-01-16 Vasil Zhelinski

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

The ground axiom is the assertion that the set-theoretic universe is not obtainable by forcing over any inner model. Although this appears at first to be a second-order assertion, it is actually first-order expressible in the language of…

Logic · Mathematics 2016-07-05 Joel David Hamkins

We prove that Solovay's set $\Sigma$ is generic over the ground model via a forcing notion whose order relation $\subseteq$-extends the given order relation.

Logic · Mathematics 2018-11-07 Vladimir Kanovei , Vassily Lyubetsky

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

We prove that in a countable theory $T$ fully stable over a predicate $P$, any $\lam$-complete set $A$ has the $\lam$-existence property. This means that $A$ can be extended to a $\lam$-saturated model of $T$ without changing the $P$-part.…

Logic · Mathematics 2026-05-07 Alexander Usvyatsov

We propose an extension of Aczel's constructive set theory CZF by an axiom for inductive types and a choice principle, and show that this extension has the following properties: it is interpretable in Martin-Lof's type theory (hence…

Logic · Mathematics 2013-09-27 Benno van den Berg , Ieke Moerdijk

We show that the Proper Forcing Axiom implies the Singular Cardinal Hypothesis. The proof is by interpolation and uses the Mapping Reflection Principle.

Logic · Mathematics 2007-05-23 Matteo Viale

The paper is a first of two and aims to show that (assuming large cardinals) set theory is a tractable (and we dare to say tame) first order theory when formalized in a first order signature with natural predicate symbols for the basic…

Logic · Mathematics 2020-03-23 Matteo Viale

Generic absoluteness is the phenomenon that certain truths in the set-theoretic universe remain stable under forcing expansions. A classical result by Kripke asserts that every complete Boolean algebra completely embeds into a countably…

Logic · Mathematics 2026-05-08 Cesare Straffelini

The prevalent interpretation of G\"odel's Second Theorem states that a sufficiently adequate and consistent theory does not prove its consistency. It is however not entirely clear how to justify this informal reading, as the formulation of…

Logic · Mathematics 2020-08-13 Balthasar Grabmayr

Let $S$ be a polynomial ring over a field and $I\subseteq S$ a homogeneous ideal containing a regular sequence of forms of degrees $d_1, \ldots, d_c$. In this paper we prove the Lex-plus-powers Conjecture when the field has characteristic 0…

Commutative Algebra · Mathematics 2019-03-26 Giulio Caviglia , Alessio Sammartano