English
Related papers

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

200 papers

We show that in the theory ZF + DC + for every cardinal {\lambda}, the set of infinite subsets of {\lambda} is well-ordered (i.e., Shelah's AX4), the {\theta}-function measuring the surjective size of the powersets P({\kappa}) can take…

Logic · Mathematics 2018-12-04 Anne Fernengel , Peter Koepke

Solovay's random-real forcing (1971) is the standard way of producing real-valued measurable cardinals. Following questions of Fremlin, by giving a new construction, we show that there are combinatorial, measure-theoretic properties of…

Logic · Mathematics 2016-08-16 Sakaé Fuchino , Noam Greenberg , Saharon Shelah

The notion of $\theta$-FAM-linkedness, introduced in the second author's master thesis, is a formalization of the notion of strong FAM limits for intervals, whose initial form and applications have appeared in the work of Saharon Shelah,…

Logic · Mathematics 2025-07-16 Diego A. Mejía , Andrés F. Uribe-Zapata

A natural question, which appeared as Problem 61 in Hart and van Mill's list of open problems on $\beta\omega$ (2024), asks whether every finite partial order is embeddable in the Rudin--Keisler order on (types of) ultrafilters over a…

General Topology · Mathematics 2025-11-25 Nikolai L. Poliakov , Denis I. Saveliev

A subset of a topological space is said to be \emph{universally measurable} if it is measured by the completion of each countably additive $\sigma$-finite Borel measure on the space, and \emph{universally null} if it has measure zero for…

Logic · Mathematics 2010-03-15 Paul Larson , Itay Neeman , Saharon Shelah

We study variants of classical Laver forcing defined from co-ideals and analyze their combinatorial properties in terms of the Kat\v{e}tov order. In particular, we give a Kat\v{e}tov-theoretic characterization of when Laver forcing…

We introduce a stronger version of an $\omega_1$-guessing model, which we call an indestructibly $\omega_1$-guessing model. The principle IGMP states that there are stationarily many indestructibly $\omega_1$-guessing models. This…

Logic · Mathematics 2019-07-09 Sean Cox , John Krueger

We study the influence of strong forcing axioms on the complexity of the non-stationary ideal on $\omega_2$ and its restrictions to certain cofinalities. Our main result shows that the strengthening $MM^{++}$ of Martin's Maximum does not…

Logic · Mathematics 2022-06-06 Sean Cox , Philipp Lücke

We prove that a wide class of strongly proper forcing posets have quotients with strong properties. Specifically, we prove that quotients of forcing posets which have simple universal strongly generic conditions on a stationary set of…

Logic · Mathematics 2015-06-08 Sean Cox , John Krueger

We give results exploring the relationship between dominating and unbounded reals in Hechler extensions, as well as the relationships among the extensions themselves. We show that in the standard Hechler extension there is an unbounded real…

Logic · Mathematics 2012-01-16 Justin Palumbo

We make use of a finite support product of Jensen forcing to define a model in which there is a countable non-empty lightface $\Pi^1_2$ set of reals containing no ordinal-definable real.

Logic · Mathematics 2018-09-05 Vladimir Kanovei , Vassily Lyubetsky

Consider $(\kappa^{+++},\kappa^{++}) \twoheadrightarrow (\kappa^+,\kappa)$ where $\kappa$ is an uncountable regular cardinal. By a result of Shelah's we have $\operatorname{cof}(X \cap \kappa^{++}) = \kappa$ for almost all $X \subset…

Logic · Mathematics 2020-03-26 Dominik Adolf

We continue the work from [8] and make a small -- but significant -- improvement to the definition of $j$-decomposable system. This provides us with a better lifting of elementary embeddings to symmetric extensions. In particular, this…

Logic · Mathematics 2026-04-21 Yair Hayut , Asaf Karagila

We use the technique of "classical realizability" to build new models of ZF + DC in which R is not well ordered. This gives new relative consistency results, probably not obtainable by forcing. This gives also a new method to get programs…

Logic in Computer Science · Computer Science 2018-03-20 Jean-Louis Krivine

Whenever P is a proper definable forcing for adding a real, the countable support iteration of P has all the preservation properties it can possibly have, within a wide syntactically identified class of properties.

Logic · Mathematics 2007-05-23 Jindrich Zapletal

We prove that if Q is a nw-nep forcing then it cannot add a dominating real. We also prove that Amoeba forcing cannot be P(X)/I if I is an aleph_1-complete ideal.

Logic · Mathematics 2007-05-23 Saharon Shelah

In this paper, we deal with the notions of naturality from category theory and definablity from model theory and their interactions. In this regard, we present three results. First, we show, under some mild conditions, that naturality…

Logic · Mathematics 2025-10-02 Mohsen Asgharzadeh , Mohammad Golshani , Saharon Shelah

With every $\sigma$-ideal $I$ on a Polish space we associate the $\sigma$-ideal $I^*$ generated by the closed sets in $I$. We study the forcing notions of Borel sets modulo the respective $\sigma$-ideals $I$ and $I^*$ and find connections…

Logic · Mathematics 2010-01-19 Marcin Sabok , Jindrich Zapletal

The stable core, an inner model of the form $\langle L[S],\in, S\rangle$ for a simply definable predicate $S$, was introduced by the first author in [Fri12], where he showed that $V$ is a class forcing extension of its stable core. We study…

Logic · Mathematics 2019-10-08 Sy-David Friedman , Victoria Gitman , Sandra Müller

We introduce exacting cardinals and a strengthening of these, ultraexacting cardinals. These are natural large cardinals defined equivalently as weak forms of rank-Berkeley cardinals, strong forms of J\'onsson cardinals, or in terms of…

Logic · Mathematics 2025-09-17 Juan P. Aguilera , Joan Bagaria , Philipp Lücke