English
Related papers

Related papers: Few new reals

200 papers

Assuming that there is no inner model with a strong cardinal, the following is shown: any subset of \omega_1 can be made \Delta^1_3 (in the codes) by a reasonable set-forcing; there is a reasonable set-generic extension with a \Delta^1_3…

Logic · Mathematics 2009-09-25 Ralf Schindler

It was realized early on that topologies can model constructive systems, as the open sets form a Heyting algebra. After the development of forcing, in the form of Boolean-valued models, it became clear that, just as over ZF any…

Logic · Mathematics 2015-10-06 Robert Lubarsky

We study the question of when a given countable ordinal $\alpha$ is $\Sigma^1_n$- or $\Pi^1_n$-reflecting in models which are neither $\mathsf{PD}$ models nor the constructible universe, focusing on generic extensions of $L$. We prove,…

Logic · Mathematics 2023-11-22 Juan P. Aguilera , Corey Bacal Switzer

We define and investigate versions of Silver and Mathias forcing with respect to lower and upper density. We focus on properness, Axiom A, chain conditions, preservation of cardinals and adding Cohen reals. We find rough forcings that…

Logic · Mathematics 2021-02-12 Giorgio Laguzzi , Heike Mildenberger , Brendan Stuber-Rousselle

Counterfactual explanations (CFEs) are essential for interpreting black-box models, yet they often become invalid when models are slightly changed. Existing methods for generating robust CFEs are often limited to specific types of models,…

Machine Learning · Computer Science 2026-04-21 Marcin Kostrzewa , Maciej Zięba , Jerzy Stefanowski

It is well known to generalize the meagre ideal replacing aleph_0 by a (regular) cardinal lambda > aleph_0 and requiring the ideal to be lambda^+-complete. But can we generalize the null ideal? In terms of forcing, this means finding a…

Logic · Mathematics 2017-01-20 Saharon Shelah

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

We prove that omega^2 strictly bounds the iterations required for modal definable functions to reach a fixed point across all countable structures. The result corrects and extends the previously claimed result by the first and third authors…

Logic in Computer Science · Computer Science 2025-11-05 Bahareh Afshari , Giacomo Barlucchi , Graham E. Leigh

The Carath\'eodory theorem on the construction of a measure is generalized by replacing the outer measure with an approximation of it and generalizing the Carath\'eodory measurability. The new theorem is applied to obtain dynamically…

Functional Analysis · Mathematics 2017-11-15 Ivan Werner

We show that it is consistent with MA + the negation of CH, that the Forcing Axiom fails for all forcing notions in the class of omega^omega-bounding forcing notions with norms of "Norms on possibilities I: forcing with trees and…

Logic · Mathematics 2013-01-04 Tomek Bartoszynski , Andrzej Roslanowski

We prove various iteration theorems for forcing classes related to subproper and subcomplete forcing, introduced by Jensen. In the first part, we use revised countable support iterations, and show that 1) the class of subproper,…

Logic · Mathematics 2025-04-16 Gunter Fuchs , Corey Bacal Switzer

The two parallel concepts of "small" sets of the real line are meagre sets and null sets. Those are equivalent to Cohen forcing and Random real forcing for $\aleph^{\aleph_0}_0$; in spite of this similarity, the Cohen forcing and Random…

Logic · Mathematics 2023-08-24 Shani Cohen , Saharon Shelah

We show that if $cf(2^{\aleph_0})=\aleph_1,$ then any non-trivial $\aleph_1$-closed forcing notion of size $\leq 2^{\aleph_0}$ is forcing equivalent to $Add(\aleph_1, 1),$ the Cohen forcing for adding a new Cohen subset of $\omega_1.$ We…

Logic · Mathematics 2020-03-11 Mohammad Golshani , Saharon Shelah

In this paper, we investigate connections between structures present in every generic extension of the universe $V$ and computability theory. We introduce the notion of {\em generic Muchnik reducibility} that can be used to to compare the…

Logic · Mathematics 2014-12-11 Julia Knight , Antonio Montalban , Noah Schweber

The following results are proved: (a) In a model obtained by adding aleph_2 Cohen reals, there is always a c.c.c. complete Boolean algebra without the weak Freese-Nation property. (b) Modulo the consistency strength of a supercompact…

Logic · Mathematics 2007-05-23 Sakaé Fuchino , Stefan Geschke , Saharon Shelah , Lajos Soukup

To ease analysis and simulation we make low-dimensional models of complicated dynamical systems. Centre manifold theory provides a systematic basis for the reduction of dimensionality from some detailed dynamical prescription down to a…

chao-dyn · Physics 2009-10-31 A. J. Roberts

The bounded proper forcing axiom BPFA is the statement that for any family of aleph_1 many maximal antichains of a proper forcing notion, each of size aleph_1, there is a directed set meeting all these antichains. A regular cardinal kappa…

Logic · Mathematics 2016-09-06 Martin Goldstern , Saharon Shelah

We introduce and study a family of axioms that closely follows the pattern of parametrized diamonds, studied by Moore, Hru\v{s}\'ak, and D\v{z}amonja in [13]. However, our approach appeals to model theoretic / forcing theoretic notions,…

Logic · Mathematics 2025-03-18 Ziemowit Kostana

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

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