Marcin Sabok
The aim of this short note is to communicate a simple solution to the problem posed in [1] as Question 7.2.7: is it true that for every ccc $σ$-ideal I any I-positive Borel set contains modulo I an I-positive closed set?
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
We show that for a Suslin ccc forcing notion $\mathbb Q$ adding a Hechler real, ``$\text{ZF}+\text{DC}_{ω_1}+$all sets of reals are $I_{\mathbb Q,\aleph_0}$-measurable'' implies the existence of an inner model with a measurable cardinal. We also introduce a wide class of Suslin ccc forcing notions which add a Hechler real, so that the above result applies to them.
We present a version with non-definable forcing notions of Shelah's theory of iterated forcing along a template. Our main result, as an application, is that, if $κ$ is a measurable cardinal and $θ<κ<μ<λ$ are uncountable regular cardinals, then there is a ccc poset forcing $\mathfrak{s}=θ<\mathfrak{b}=μ<\mathfrak{a}=λ$. Another application is to get models with large continuum where the groupwise-density number $\mathfrak{g}$ assumes an arbitrary regular value.
Boban Velickovic asked the following question: Is there a nontrivial forcing notion with the Sacks property which is also ccc? A ``definable'' variant of this question has been answered in [Sh:480] (math.LO/9303208): Every nontrivial Souslin forcing notion which has the Sacks property has an uncountable antichain. Here we show that it is consistent that every nontrivial forcing notion which has the Sacks property has an uncountable antichain. Independently, Velickovic has also proved the consistency of this statement.
The present paper has three themes. First, we continue the investigations started in Judah, Roslanowski and Shelah \math.LO/9310224 and Roslanowski and Shelah math.LO/9807172, math.LO/9703222, and we investigate the method of norms on possibilities in the context of ccc forcing notions, getting a number of constructions of nicely definable ccc forcings. The second theme of the paper is a part of the general program ``how special are random and Cohen forcing notions (or: the respective ideals)''. Shelah math.LO/9303208 shows that the two forcing notions may occupy special positions in the realm…
We give a model where there is a ccc Souslin forcing which does not satisfy the Knaster condition. Next, we present a model where there is a sigma-linked not sigma-centered Souslin forcing such that all its small subsets are sigma-centered but Martin Axiom fails for this order. Furthermore, we construct a totally nonhomogeneous Souslin forcing and we build a Souslin forcing which is proper but not ccc that does not contain a perfect set of mutually incompatible conditions. Finally we show that ccc Sigma^1_2-notions of forcing may not be indestructible ccc.
A ccc indestructible construction with CH
本文提出了一种基于Kurepa家族的构造方法，用于在CH下构建与完整协调Suslin树相关的ccc不可摧毁性质，并揭示了强制操作在保持Suslin树时的强负划分关系。
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 forced isomorphic by a ccc forcing. We give examples showing that the hypothesis on the number of complete types is necessary and what happens if `ccc' is replaced other cardinal-preserving adjectives. We also give an example showing that membership in a pseudo-elementary class can be altered by very simple cardinal-preserving forcings.
This is an overview about a method of constructing ccc forcings: Suppose first that a continuous, commutative system of complete embeddings between countable forcings indexed along $ω_1$ is given. Then its direct limit satisfies ccc by a well-known theorem on finite support iterations. However, this limit has size at most $ω_1$. To get larger forcings, we do not consider linear systems but higher-dimensional systems which are indexed along simplified morasses.
Saccharinity with ccc
本文利用creatures技术构造了若干Suslin ccc非甜forcing概念，探讨了ZFC与ZF+实数集等于Borel集模null理想闭包的等价性，以及ω₁序列的构造。
A ccc-generically supercompact cardinal $κ$ can be smaller than or equal to the continuum. On the other hand, such a cardinal $κ$ still satisfies diverse largeness properties, like that it is a stationary limit of ccc-generically measurable cardinals (Theorem 4.1). This is in a strong contrast to $\cal P$-generically supercompact cardinals for the class $\cal P$ of all $σ$-closed posets, which can be $\aleph_n$ for any n>1.
$Σ^1_3$-absoluteness for ccc forcing means that for any ccc forcing $P$, ${H_{ω_1}}^V \prec_{Σ_2}{H_{ω_1}}^{V^P}$. "$ω_1$ inaccessible to reals" means that for any real $r$, ${ω_1}^{L[r]}<ω_1$. To measure the exact consistency strength of "$Σ^1_3$-absoluteness for ccc forcing and $ω_1$ is inaccessible to reals", we introduce a weak version of a weakly compact cardinal, namely, a (lightface) $Σ^1_2$-indescribable cardinal; $κ$ has this property exactly if it is inaccessible and $H_κ\prec_{Σ_2} H_{κ^+}$.
We study the spectrum of forcing notions between the iterations of $σ$-closed followed by ccc forcings and the proper forcings. This includes the hierarchy of $α$-proper forcings for indecomposable countable ordinals as well as the Axiom A forcings. We focus on the bounded forcing axioms for the hierarchy of $α$-proper forcings and connect them to a hierarchy of weak club guessing principles. We show that they are, in a sense, dual to each other. In particular, these weak club guessing principles separate the bounded forcing axioms for distinct countable indecomposable ordinals. In the study o…
We prove that if there exists a simplified $(ω_1,2)$-morass, then there is a ccc forcing which adds an $ω_3$-chain in P($ω_1$) mod finite and a ccc forcing which adds a family of $ω_3$-many strongly almost disjoint functions from $ω_1$ to $ω$. The idea is to use a finite support iteration of countable forcings which is not linear but three-dimensional.
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 and H. Judah, Set Theory: on the structure of the real line, A K Peters, Wellesley, MA, 1995; pages 193-203.]
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 real line which is order-isomorphic to Q with respect to set-inclusion. This is a variation of Hechler's classical result in the theory of forcing.
Abstract Corrected Iterations
研究 $(<λ)$-支撑迭代可定义力迫概念，证明此类迭代可被修正，从而得出 Judah 和 Shelah 关于 Suslin ccc 力迫有限支撑迭代结果的一个类比。
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 null ideal of the real line which is order-isomorphic to Q with respect to set-inclusion. This is a variation of Hechler's classical result in the theory of forcing, and the statement of the theorem for the meager ideal has been already proved by Bartoszynski and the author.
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.
Methods of Higher Forcing Axioms was a small workshop in Norwich, taking place between 10--12 of September, 2019. The goal was to encourage future collaborations, and create more focused threads of research on the topic of higher forcing axioms. This is an improved version of the notes taken during the meeting by Asaf Karagila.
A note on iterating strongly $(<λ)$-closed stationary $λ^+$-cc forcing
本文探讨了迭代$(<λ)$-闭 stationary $λ^+$-cc forcing 的定理，讨论其与其它迭代定理及集合论公理的关系，特别是Sh80中的结果。
Forcing techniques for Cichoń's Maximum: Lecture notes for the mini-course at the University of Vienna
本文探讨通过强制技术构建Cichoń最大值模型的方法，消除了对大基数的依赖，展示相关集合论特征之间的关系。
We note that some form of the condition "$p_1, p_2$ have a $\leq_{\mathbb{Q}}$-lub in $\mathbb{Q}$" is necessary in some forcing axiom for $λ$-complete $μ^+$-c.c. forcing notions. We also show some versions are really stronger than others.
In these notes we present the method introduced by Neeman of generalized side conditions with two types of models. We then discuss some applications: the Friedman-Mitchell poset for adding a club in ω_2 with finite conditions, Koszmider's forcing construction of a strong chain of length ω_2 of functions from ω_1 to ω_1, and the Baumgartner-Shelah forcing construction of a thin very tall superatomic Boolean algebra.
Strong forcing axioms and the continuum problem (following Asperó's and Schindler's proof that $\mathbf{MM}^{++}$ implies Woodin's Axiom $(*)$)
本文基于Asperó和Schindler关于$\mathbf{MM}^{++}$蕴含Woodin公理$(*)$的证明，探讨了连续统问题及其与集合论近期众多进展的联系。
These notes are extracted from the lectures on forcing axioms and applications held by professor Matteo Viale at the University of Turin in the academic year 2011-2012. Our purpose is to give a brief account on forcing axioms with a special focus on some consequences of them (SRP, OCA, PID). These principles were first isolated by Todor\v cević and interpolate most consequences of MM and PFA, thus providing a useful insight on the combinatorial structure of the theory of forcing axioms. In the first part of this notes we will give a brief account on forcing axioms, introducing some equivalent …
Theorem: Let $n\ge 2.$ There is a CCC in $L$ forcing notion $P=P_n\in L$ such that $P$-generic extensions of $L$ are of the form $L[a],$ where $a\subseteqω$ and 1) $a$ is $Δ^1_{n+1}$ in $L[a]$; and 2) if $b\in L[a],$ $b\subseteqω$ is $Σ^1_n$ in $L[a]$ then $b\in L$ and $b$ is $Σ^1_n$ in $L$. In addition, if a model $M$ extends $L$ and contains two different $P$-generic sets $a,\,a'\subseteqω,$ then $ω^M_1 > ω^L_1$. Comment: For $n=2,$ this is a result of Jensen and Johnsbråten, 1974. In this case, 2) is a corollary of the Shoenfield absoluteness theorem.
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 and MA. Section 14 and 15 contain new results concerning the lengths of Borel hierarchies in the Cohen and random real model. Part 2 contains standard results on the theory of Analytic sets. Section 25 contains Harrington's Theorem that it is consistent to have $Π^1_2$ sets of arbitrary cardinality. Part 3 has the usual separation theorems. Part 4 gives some …
Jensen $\varDelta^1_3$ reals by means of ZFC$^-$ or second order Peano arithmetic
本文解决 Jensen 构造在二阶 Peano 算术或 ZFC$^-$ 内重现的难题，通过在 forcing 构造中仅消灭可定义反链来规避 CCC 证明障碍，并定义了极小 $\varPi^1_2$ 单例模型。
In this short note, we shall prove some observations regarding the connection between indestructible $ω_1$-guessing models and the $ω_1$-approximation property of forcing notions.
In this note we will discuss a new reflection principle which follows from the Proper Forcing Axiom. The immediate purpose will be to prove that the bounded form of the Proper Forcing Axiom implies both that 2^omega = omega_2 and that L(P(omega_1)) satisfies the Axiom of Choice. It will also be demonstrated that this reflection principle implies that combinatorial principle Square(kappa) fails for all regular kappa > omega_1.
Two questions on $E_0$-like generic equivalence
本文解答了关于$E_0$-类泛型等价的两个问题，纠正了原条件表述，并构造了满足修正条件的Prikry型及更广泛例子，同时证明条件蕴含不可达基数。
A set $A$ of integers is called total if there is an algorithm which, given an enumeration of $A$, enumerates the complement of $A$, and called cototal if there is an algorithm which, given an enumeration of the complement of $A$, enumerates $A$. Many variants of totality and cototality have been studied in computability theory. In this note, by an effective forcing construction with strongly infinite dimensional Cantor manifolds, which can be viewed as an effectivization of Zapletal's "half-Cohen" forcing (i.e., the forcing with Henderson compacta), we construct a set of integers whose enumer…
We show in this note that in the forcing extension by $Add(ω,\beth_ω)$, the following Ramsey property holds: for any $r\in ω$ and any $f: \mathbb{R}\to r$, there exists an infinite $X\subset \mathbb{R}$ such that $X+X$ is monochromatic under $f$. We also show the Ramsey statement above is true in $\mathrm{ZFC}$ when $r=2$. This answers two questions by Komjáth, Leader, Russell, Shelah, Soukup and Vidnyánszky.
In this issue we celebrate the appearance of the proceedings of the first SPM Workshop, announce several mathematical breakthroughs, have two extended contributions by Babinkostova, and a new open problem by Kalenda. Contents: Editor's note; Proceedings of the first workshop on Coverings, Selections, and Games in Topology; A five element basis for the uncountable linear orders; Set mapping reflection; The Proper Forcing Axiom, Prikry forcing, and the Singular Cardinals Hypothesis; A solution to the L space problem and related ZFC constructions; Countable Tightness, Elementary Submodels and Hom…
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。