中文
相关论文

相关论文: Hechler's theorem for the null ideal

200 篇论文

We prove the following theorem: For a partially ordered set Q such that every countable subset has a strict upper bound, there is a forcing notion satisfying ccc such that, in the forcing model, there is a basis of the meager ideal of the…

逻辑 · 数学 2007-05-23 Tomek Bartoszynski , Masaru Kada

We show that for a Suslin ccc forcing notion $\mathbb Q$ adding a Hechler real, ``$\text{ZF}+\text{DC}_{\omega_1}+$all sets of reals are $I_{\mathbb Q,\aleph_0}$-measurable'' implies the existence of an inner model with a measurable…

逻辑 · 数学 2023-01-03 Mohammad Golshani , Haim Horowitz , Saharon Shelah

The forcing theorem is the most fundamental result about set forcing, stating that the forcing relation for any set forcing is definable and that the truth lemma holds, that is everything that holds in a generic extension is forced by a…

I prove forcing preservation theorems for products of definable partial orders preserving the cofinality of the meager or null ideal. Rectangular Ramsey theorems for related ideals follow from the proofs.

逻辑 · 数学 2007-05-23 Jindrich Zapletal

We develop a toolbox for forcing over arbitrary models of set theory without the axiom of choice. In particular, we introduce a variant of the countable chain condition and prove an iteration theorem that applies to many classical forcings…

逻辑 · 数学 2023-01-02 Daisuke Ikegami , Philipp Schlicht

The main result of this paper is a partial answer to [math.LO/9909115, Problem 5.5]: a finite iteration of Universal Meager forcing notions adds generic filters for many forcing notions determined by universality parameters. We also give…

逻辑 · 数学 2013-01-04 Andrzej Roslanowski , Saharon Shelah

We present reasons for developing a theory of forcing notions which satisfy the properness demand for countable models which are not necessarily elementary submodels of some (H(chi), in). This leads to forcing notions which are…

逻辑 · 数学 2016-09-07 Saharon Shelah

We study the spectrum of forcing notions between the iterations of $\sigma$-closed followed by ccc forcings and the proper forcings. This includes the hierarchy of $\alpha$-proper forcings for indecomposable countable ordinals as well as…

逻辑 · 数学 2011-02-14 David Aspero , Sy-David Friedman , Miguel Angel Mota , Marcin Sabok

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…

逻辑 · 数学 2016-09-06 John T. Baldwin , Michael C. Laskowski , Saharon Shelah

Measurability with respect to ideals is tightly connected with absoluteness principles for certain forcing notions. We study a uniformization principle that postulates the existence of a uniformizing function on a large set, relative to a…

逻辑 · 数学 2022-05-31 Sandra Müller , Philipp Schlicht

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…

逻辑 · 数学 2007-05-23 Michael C. Laskowski , Saharon Shelah

It is shown that the boldface maximality principle for subcomplete forcing, together with the assumption that the universe has only set-many grounds, implies the existence of a (parameter-free) definable well-ordering of…

逻辑 · 数学 2018-02-15 Gunter Fuchs

The class forcing theorem, which asserts that every class forcing notion $\mathbb{P}$ admits a forcing relation $\Vdash_{\mathbb{P}}$, that is, a relation satisfying the forcing relation recursion -- it follows that statements true in the…

A classical theorem of Hechler asserts that the structure $\left(\omega^\omega,\le^*\right)$ is universal in the sense that for any $\sigma$-directed poset P with no maximal element, there is a ccc forcing extension in which…

逻辑 · 数学 2020-04-21 Gabriel Fernandes , Miguel Moreno , Assaf Rinot

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…

逻辑 · 数学 2017-01-20 Saharon Shelah

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…

组合数学 · 数学 2021-02-09 Xin He , Heping Zhang

The purpose of this paper is to investigate forcing as a tool to construct universal models. In particular, we look at theories of initial segments of the universe and show that any model of a sufficiently rich fragment of those theories…

逻辑 · 数学 2025-03-07 Francesco Parente , Matteo Viale

We describe a method of building ``nice'' sigma-ideals from Souslin ccc forcing notions. [These notes were written down in 1992, but were not submitted to any journal. In a slightly modified form, they were incorporated to: T. Bartoszynski…

逻辑 · 数学 2007-05-23 Haim Judah , Andrzej Roslanowski

Various theorems for the preservation of set-theoretic axioms under forcing are proved, regarding both forcing axioms and axioms true in the Levy-Collapse. These show in particular that certain applications of forcing axioms require to add…

逻辑 · 数学 2007-05-23 Bernhard Koenig

J. Zapletal asked if all the forcing notions considered in his monograph are homogeneous. Specifically, he asked if the forcing consisting of Borel sets of $\sigma$-finite 2-dimensional Hausdorff measure in $\mathbb{R}^3$ (ordered under…

逻辑 · 数学 2018-09-07 Márton Elekes , Juris Steprāns
‹ 上一页 1 2 3 10 下一页 ›