English
Related papers

Related papers: On the classification of definable ccc forcing not…

200 papers

Inspired by Zermelo's quasi-categoricity result characterizing the models of second-order Zermelo-Fraenkel set theory $\text{ZFC}_2$, we investigate when those models are fully categorical, characterized by the addition to $\text{ZFC}_2$…

Logic · Mathematics 2022-03-25 Joel David Hamkins , Hans Robin Solberg

We investigate iterating the construction of $C^{*}$, the $L$-like inner model constructed using first order logic augmented with the "cofinality $\omega$" quantifier. We first show that $\left(C^{*}\right)^{C^{*}}=C^{*}\ne L$ is…

Logic · Mathematics 2021-09-14 Ur Ya'ar

We show that Dependent Choice is a sufficient choice principle for developing the basic theory of proper forcing, and for deriving generic absoluteness for the Chang model in the presence of large cardinals, even with respect to…

Logic · Mathematics 2023-06-22 David Asperó , Asaf Karagila

In this short note, we shall prove some observations regarding the connection between indestructible $\omega_1$-guessing models and the $\omega_1$-approximation property of forcing notions.

Logic · Mathematics 2022-02-18 Rahman Mohammadpour

The consistency of the theory $\mathsf{ZF} + \mathsf{AD}_{\mathbb{R}} + {}$``every set of reals is universally Baire'' is proved relative to $\mathsf{ZFC} + {}$``there is a cardinal that is a limit of Woodin cardinals and of strong…

Logic · Mathematics 2025-06-18 Paul B. Larson , Grigor Sargsyan , Trevor Wilson

We prove that the theory of the models constructible using finitely many cofinality quantifiers - $C_{\lambda_{1},...,\lambda_{n}}^{*}$ and $C_{<\lambda_{1},...,<\lambda_{n}}^{*}$ for $\lambda_{1},...,\lambda_{n}$ regular cardinals - is…

Logic · Mathematics 2021-12-03 Ur Ya'ar

Let \alpha be a countable ordinal and \P(\alpha) the collection of its subsets isomorphic to \alpha. We show that the separative quotient of the set \P (\alpha) ordered by the inclusion is isomorphic to a forcing product of iterated reduced…

Logic · Mathematics 2017-09-26 Milos Kurilic

Let G be a graph with a perfect matching. A complete forcing set of G is a subset of edges of G to which the restriction of every perfect matching is a forcing set of it. The complete forcing number of G is the minimum cardinality of…

Combinatorics · Mathematics 2021-02-09 Xin He , Heping Zhang

We show that many countable support iterations of proper forcings preserve Souslin trees. We establish sufficient conditions in terms of games and we draw connections to other preservation properties. We present a proof of preservation…

Logic · Mathematics 2013-09-03 Heike Mildenberger , Saharon Shelah

We study the influence of the existence of large cardinals on the existence of wellorderings of power sets of infinite cardinals $\kappa$ with the property that the collection of all initial segments of the wellordering is definable by a…

Logic · Mathematics 2017-04-04 Philipp Lücke , Philipp Schlicht

While non-contextual hidden-variable theories are proved to be impossible, contextual ones are possible. In a contextual hidden-variable theory, an observable is called a beable if the hidden-variable assigns its value in a given…

Quantum Physics · Physics 2023-11-17 Masanao Ozawa

We show that the existence of a Pi^{1}_{N}-indescribable cardinal over the Zermelo-Fraenkel's set theory ZF is proof-theoretically reducible to iterations of Mostowski collapsings and lower Mahlo operations. Furthermore we describe a…

Logic · Mathematics 2014-09-09 Toshiyasu Arai

We make use of some observations on the core model, for example assuming $V=L [ E ]$, and that there is no inner model with a Woodin cardinal, and $M$ is an inner model with the same cardinals as $V$, then $V=M$. We conclude in this latter…

Logic · Mathematics 2021-10-27 Jouko Väänänen , Philip Welch

To construct interpretable explanations that are consistent with the original ML model, counterfactual examples---showing how the model's output changes with small perturbations to the input---have been proposed. This paper extends the work…

Machine Learning · Computer Science 2020-06-16 Divyat Mahajan , Chenhao Tan , Amit Sharma

We introduce and study some variants of a notion of canonical set theoretical truth. By this, we mean truth in a transitive proper class model $M$ of ZFC that is uniquely characterized by some $\in$-formula. We show that there are…

Logic · Mathematics 2026-05-19 Merlin Carl , Philipp Schlicht

We deal with an iteration theorem of forcing notion with a kind of countable support of nice enough forcing notion which is proper aleph_2-c.c. forcing notions. We then look at some special cases (Q_D 's preceded by random forcing).

Logic · Mathematics 2007-05-23 Saharon Shelah

We study models M of set theory that are "condensable", in the sense that there is an "ordinal" v of M such that the rank initial segment of M determined by v is both isomorphic to M, and also an elementary submodel of M for infinitary…

Logic · Mathematics 2021-06-21 Ali Enayat

We investigate the relation of countable closed subsets of the reals with respect to continuous monotone embeddability; we show that there are exactly aleph_1 many equivalence classes with respect to this embeddability relation. This is an…

Logic · Mathematics 2007-05-23 Arnold Beckmann , Martin Goldstern , Norbert Preining

Whenever I is a projectively generated projectively defined sigma ideal on the reals, if ZFC+large cardinals proves cov(I)=continuum then ZFC+large cardinals proves non(I)<aleph four.

Logic · Mathematics 2007-05-23 Jindrich Zapletal

We introduce more properties of forcing notions which imply that their lambda-support iterations are lambda-proper, where lambda is an inaccessible cardinal. This paper is a direct continuation of section A.2 of math.LO/0210205. As an…

Logic · Mathematics 2013-01-04 Andrzej Roslanowski , Saharon Shelah
‹ Prev 1 8 9 10 Next ›