Andrzej Rosłanowski, Saharon Shelah
We prove that the Sacks forcing collapses the continuum onto the dominating number d, answering the question of Carlson and Laver. Next we prove that if a proper forcing of the size at most continuum collapses omega_2 then it forces diamond_{omega_1} .
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
An extension of Subcomplete Forcing Axiom which implies $\diamondsuit^+$
本文证明子完全力迫公理与菱形原则$\diamondsuit^+$相容，推广了该公理的一致性结果。
This article continues Roslanowski and Shelah math.LO/9906024 and 1105.6049 We introduce here yet another property of (<lambda)-strategically complete forcing notions which implies that their lambda-support iterations do not collapse lambda^+.
Forcing Diamond and Applications to Iterability
本文证明高阶Sacks力迫与club Miller力迫可添加diamond序列，并肯定回答了κ-Sacks力迫的κ-支撑迭代不坍缩κ+且为κ-proper的长期问题，结果适用于其他高阶树力迫。
I explore two separate topics: the concept of jointness for set-theoretic guessing principles, and the notion of grounded forcing axioms. A family of guessing sequences is said to be joint if all of its members can guess any given family of targets independently and simultaneously. I primarily investigate jointness in the case of various kinds of Laver diamonds. In the case of measurable cardinals I show that, while the assertions that there are joint families of Laver diamonds of a given length get strictly stronger with increasing length, they are all equiconsistent. This is contrasted with …
Viale \cite{Viale_GuessingModel} introduced the notion of Generic Laver Diamond at $κ$---which we denote $\Diamond_{\text{Lav}}(κ)$---asserting the existence of a single function from $κ\to H_κ$ that behaves much like a supercompact Laver function, except with generic elementary embeddings rather than internal embeddings. Viale proved that the Proper Forcing Axiom (PFA) implies $\Diamond_{\text{Lav}}(ω_2)$. We strengthen his theorem by weakening the hypothesis to a statement strictly weaker than PFA. We also show that the principle $\Diamond_{\text{Lav}}(κ)$ provides a uniform, simple construc…
Guessing genericity -- looking at parametrized diamonds from a different perspective
本文从模型论与力迫论视角提出一族参数化钻石公理，揭示不同原则间的深层联系，并证明测度代数力迫保持$\diamondsuit(\mathfrak{d})$变体，改进已有结果。
If kappa is any strongly unfoldable cardinal, then this is preserved in a forcing extension in which Diamond_kappa(REG) fails. This result continues the progression of the corresponding results for weakly compact cardinals, due to Woodin, and for indescribable cardinals, due to Hauser.
We prove that the Devlin-Shelah weak diamond implies Galvin's property. On the other hand, Galvin's property is consistent with the negation of the weak diamond, and even with Martin's axiom. We show that the proper forcing axiom implies a relative to the negation of Galvin's property for $\aleph_1$.
We consider a cardinal invariant closely related to Hindman's theorem. We prove that this cardinal invariant is small in the iterated Sacks perfect set forcing model, and that its corresponding parametrized diamond principle implies the existence of union ultrafilters. As a corollary, this establishes the existence of union ultrafilters in the iterated Sacks model of Set Theory.
We investigate the interaction between compactness principles and guessing principles in the Radin forcing extensions. In particular, we show that in any Radin forcing extension with respect to a measure sequence on $κ$, if $κ$ is weakly compact, then $\diamondsuit(κ)$ holds. This provides contrast with a well-known theorem of Woodin, who showed that in a certain Radin extension over a suitably prepared ground model relative to the existence of large cardinals, the diamond principle fails at a strongly inaccessible Mahlo cardinal. Refining the analysis of the Radin extensions, we consistently …
The purpose of this article is to prove that the forcing axiom for completely proper forcings is inconsistent with the Continuum Hypothesis. This answers a longstanding problem of Shelah. The corresponding completely proper forcing which can be constructed using CH is moreover a tree whose square is special off the diagonal. While such trees had previously been constructed by Jensen and Kunen under the assumption of Jensen's diamond principle, this is the first time such a construction has been carried out using the Continuum Hypothesis.
We present three natural combinatorial properties for class forcing notions, which imply the forcing theorem to hold. We then show that all known sufficent conditions for the forcing theorem (except for the forcing theorem itself), including the three properties presented in this paper, imply yet another regularity property for class forcing notions, namely that proper classes of the ground model cannot become sets in a generic extension, that is they do not have set-sized names in the ground model. We then show that over certain models of Gödel-Bernays set theory without the power set axiom, …
The weakly compact reflection principle $\text{Refl}_{\text{wc}}(κ)$ states that $κ$ is a weakly compact cardinal and every weakly compact subset of $κ$ has a weakly compact proper initial segment. The weakly compact reflection principle at $κ$ implies that $κ$ is an $ω$-weakly compact cardinal. In this article we show that the weakly compact reflection principle does not imply that $κ$ is $(ω+1)$-weakly compact. Moreover, we show that if the weakly compact reflection principle holds at $κ$ then there is a forcing extension preserving this in which $κ$ is the least $ω$-weakly compact cardinal.…
We prove that there are groups in the constructible universe whose automorphism towers are highly malleable by forcing. This is a consequence of the fact that, under a suitable diamond hypothesis, there are sufficiently many highly rigid non-isomorphic Souslin trees whose isomorphism relation can be precisely controlled by forcing.
We discuss the effect of adding a single real (for various forcing notions adding reals) on cardinal invariants associated with the continuum (like the unbounding or the dominating number or the cardinals related to measure and category on the real line). For random and Cohen forcing, this question was investigated by Cicho'n and Pawlikowski; for Hechler forcing, by Judah, Shelah and myself. We show here: (1) adding an eventually different or a localization real adjoins a Luzin set of size continuum and a mad family of size omega_1; (2) Laver and Mathias forcing collapse the dominating number …
The parameter-free part $\text{PA}_2^\ast$ of $\text{PA}_2$, the 2nd order Peano arithmetic, is considered. We make use of a product/iterated Sacks forcing to define an $ω$-model of $\text{PA}_2^\ast + \text{CA}(Σ^1_2)$, in which an example of the full Comprehension schema $\text{CA}$ fails. Using Cohen's forcing, we also define an $ω$-model of $\text{PA}_2^\ast$, in which not every set has its complement, and hence the full $\text{CA}$ fails in a rather elementary way.
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 application of our iteration result we show that it is consistent that dominating numbers associated with two normal filters on lambda are distinct.
In this article we prove three main theorems: (1) guessing models are internally unbounded, (2) for any regular cardinal $κ\ge ω_2$, $\textsf{ISP}(κ)$ implies that $\textsf{SCH}$ holds above $κ$, and (3) forcing posets which have the $ω_1$-approximation property also have the countable covering property. These results solve open problems of Viale and Hachtman-Sinapova.
We prove two general results about the preservation of extendible and $C^{(n)}$-extendible cardinals under a wide class of forcing iterations (Theorems 5.4 and 7.5). As applications we give new proofs of the preservation of Vopěnka's Principle and $C^{(n)}$-extendible cardinals under Jensen's iteration for forcing the GCH, previously obtained by Brooke-Taylor and Tsaprounis, res\-pectively. We prove that $C^{(n)}$-extendible cardinals are preserved by forcing with standard Easton-support iterations for any possible $Δ_2$-definable behaviour of the power-set function on regular cardinals. We sh…
Terminal Absoluteness of Collapse Forcings
本文探讨了坍缩forcing在项目性通用绝对性中的必要性，证明在大基数假设下，坍缩forcing的绝对性等价于任意forcing的绝对性，并指出在低项目性层次下结果在ZFC中成立，揭示了坍缩forcing的终端性。
We prove a number of results about countable Borel equivalence relations with forcing constructions and arguments. These results reveal hidden regularity properties of Borel complete sections on certain orbits. As consequences they imply the nonexistence of Borel complete sections with certain features.
We introduce several properties of forcing notions which imply that their lambda-support iterations are lambda-proper. Our methods and techniques refine those studied in math.LO/9906024, math.LO/0210205, math.LO/0508272 and math.LO/0605067, covering some new forcing notions (though the exact relation of the new properties to the old ones remains undecided).
We answer Blass' question from 1989 of whether the inequality $\gu < \gro$ is strictly stronger than the filter dichotomy principle affirmatively. We show that there is a forcing extension in which every non-meagre filter on $ω$ is ultra by finite-to-one and the semifilter trichotomy does not hold. This trichotomy says: every semifilter is either meagre or comeagre or ultra by finite-to-one. The trichotomy is equivalent to the inequality $\gu<\gro$ by work of Blass and Laflamme. Combinatorics of block sequences is used to establish forcing notions that preserve suitable properties of block seq…
The theta--fan F_theta is the quotient space obtained by identifying the non--isolated points of the product theta \times (omega+1) with a single point \infty. (Here, theta has the discrete topology and omega+1 has the order topology.) We define several notions of forcing that allow us to manipulate the tightness t of products of fans. Some consequences include: t (F_theta \times F_omega) = theta does not imply the existence of a (theta,omega)--gap, new examples of first countable <theta--collectionwise Hausdorff (cwH) spaces that are not \leq theta--cwH for singular cardinals theta, and for c…
We complete a 40-year old program on the computability-theoretic analysis of Ramsey's theorem, starting with Jockusch in 1972, and improving a result of Chong, Slaman and Yang in 2014. Given a set $X$, let $[X]^n$ be the collection of all $n$-element subsets of $X$. Ramsey's theorem for $n$-tuples asserts the existence, for every finite coloring of $[ω]^n$, of an infinite set $X \subseteq ω$ such that $[X]^n$ is monochromatic. The meta-mathematical study of Ramsey has a rich history, with several long-standing open problems and seminal theorems, including Seetapun's theorem in 1995 and Liu's t…
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。