English
Related papers

Related papers: Weak prediction principles

200 papers

We prove that the class of all ordinals Ord is not weakly compact with respect to definable classes. Specifically, in any model of ZFC, the definable tree property fails for Ord, in that there is a definable Ord tree with no definable…

Logic · Mathematics 2017-10-27 Ali Enayat , Joel David Hamkins

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…

Logic · Mathematics 2017-02-07 Shimon Garti

We show that Weak Vop\v{e}nka's Principle, which is the statement that the opposite category of ordinals cannot be fully embedded into the category of graphs, is equivalent to the large cardinal principle Ord is Woodin, which says that for…

Logic · Mathematics 2020-01-27 Trevor M. Wilson

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,…

Logic · Mathematics 2007-05-23 Joel David Hamkins , Mirna Džamonja

Justin Moore's weak club-guessing principle $\mho$ admits various possible generalizations to the second uncountable cardinal. One of them was shown to hold in ZFC by Shelah. A stronger one was shown to follow from several consequences of…

Logic · Mathematics 2024-07-29 Ido Feldman

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 $\kappa$, if $\kappa$ is…

Logic · Mathematics 2022-03-01 Omer Ben-Neria , Jing Zhang

Our aim is to improve the negative results i.e. non-existence of limit models, and the failure of the generic pair property from math.LO/0609636 to inaccessible lambda as promised there. The motivation is that in [Sh:F756] the positive…

Logic · Mathematics 2011-01-06 Saharon Shelah

We prove the consistency of: for suitable strongly inaccessible cardinal lambda the dominating number, i.e. the cofinality of lambda^lambda is strictly bigger than cov(meagre_lambda), i.e. the minimal number of nowhere dense subsets of…

Logic · Mathematics 2022-09-07 Saharon Shelah

In this note we answer the following question of Grinblat: Is it consistent that for some set X, cov(NULL restriction X)=lambda is a weakly inaccessible cardinal (so X not null of course) while cov(meagre) is small, say it is aleph_1.

Logic · Mathematics 2007-05-23 Saharon Shelah

$\Sigma^1_3$-absoluteness for ccc forcing means that for any ccc forcing $P$, ${H_{\omega_1}}^V \prec_{\Sigma_2}{H_{\omega_1}}^{V^P}$. "$\omega_1$ inaccessible to reals" means that for any real $r$, ${\omega_1}^{L[r]}<\omega_1$. To measure…

Logic · Mathematics 2022-09-20 David Schrittesser

We answer a question of Usuba by showing that the combinatorial principle $UB_\lambda$ can fail at a singular cardinal. Furthermore, $\lambda$ can be taken to be $\aleph_\omega.$

Logic · Mathematics 2023-10-27 Mohammad Golshani , Saharon Shelah

We show that the notions of "strongly unfoldable cardinals", introduced by Villaveces in his model-theoretic studies of models of set theory, and "shrewd cardinals", introduced by Rathjen in a proof-theoretic context, coincide. We then…

Logic · Mathematics 2021-12-08 Philipp Lücke

A cardinal $\lambda$ satisfies a property P robustly if, whenever $\mathbb{Q}$ is a forcing poset and $|\mathbb{Q}|^+ < \lambda$, $\lambda$ satisfies P in $V^{\mathbb{Q}}$. We study the extent to which certain reflection properties of large…

Logic · Mathematics 2015-10-19 Chris Lambie-Hanson

We introduce combinatorial principles that characterize strong compactness and supercompactness for inaccessible cardinals but also make sense for successor cardinals. Their consistency is established from what is supposedly optimal.…

Logic · Mathematics 2010-12-10 Christoph Weiß

We discuss the rainbow Ramsey theorems at limit cardinals and successors of singular cardinals, addressing some questions in \cite{MR2354904} and \cite{MR2902230}. In particular, we show for inaccessible $\kappa$,…

Logic · Mathematics 2019-12-03 Jing Zhang

It is well-known that the square principle $\square_\lambda$ entails the existence of a non-reflecting stationary subset of $\lambda^+$, whereas the weak square principle $\square^*_\lambda$ does not. Here we show that if…

Logic · Mathematics 2017-11-17 Gunter Fuchs , Assaf Rinot

We prove, e.g., that if lambda=chi^+=2^chi and S subseteq {delta<lambda:cf(delta) neq cf(chi)} is stationary then diamondsuit_lambda holds true.

Logic · Mathematics 2010-06-16 Saharon Shelah

We show that the tree property, stationary reflection and the failure of approachability at $\kappa^{++}$ are consistent with $\mathfrak{u}(\kappa) = \kappa^+ < 2^\kappa$, where $\kappa$ is a singular strong limit cardinal with the…

Logic · Mathematics 2019-11-01 Radek Honzik , Sarka Stejskalova

We strengthen the revised GCH theorem by showing, e.g., that for lambda=cf(lambda)>beth_omega, for all but finitely many regular kappa<beth_omega, lambda is accessible on cofinality kappa in a weak version of it holds. In particular,…

Logic · Mathematics 2007-05-23 Saharon Shelah

An inaccessible cardinal $\kappa$ is supercompact when $(\kappa, \lambda)$-ITP holds for all $\lambda\geq \kappa.$ We prove that if there is a model of $\ZFC$ with two supercompact cardinals, then there is a model of \ZFC where…

Logic · Mathematics 2011-12-15 Laura Fontanella