Yair Hayut

dblp:179/4342 · DBLP profile ↗
← Back
9ranked-venue papers
4as first author
5since 2021 · last 2024
0000-0002-3805-7446ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 9 · 4 first-author · 5 since 2021
YearPublicationVenuePosition
2024 Mutually embeddable models of ZFC
abstract
We investigate systems of transitive models of ZFC which are elementarily embeddable into each other and the influence of definability properties on such systems.
Monroe Eskew, Sy-David Friedman, Yair Hayut, Farmer Schlutzenberg
Ann. Pure Appl. Log.3
2024 Stationary Reflection and the Failure of the SCH
abstract
Abstract In this paper we prove that from large cardinals it is consistent that there is a singular strong limit cardinal $\nu $ such that the singular cardinal hypothesis fails at $\nu $ and every collection of fewer than $\operatorname {\mathrm {cf}}(\nu )$ stationary subsets of $\nu ^{+}$ reflects simultaneously. For $\operatorname {\mathrm {cf}}(\nu )> \omega $ , this situation was not previously known to be consistent. Using different methods, we reduce the upper bound on the consistency strength of this situation for $\operatorname {\mathrm {cf}}(\nu ) = \omega $ to below a single partially supercompact cardinal. The previous upper bound of infinitely many supercompact cardinals was due to Sharon.
Omer Ben-Neria, Yair Hayut, Spencer Unger
J. Symb. Log.2
2022 Subcompact Cardinals, Type Omission, and ladder Systems
abstract
Abstract We provide a model theoretical and tree property-like characterization of $\lambda $ - $\Pi ^1_1$ -subcompactness and supercompactness. We explore the behavior of these combinatorial principles at accessible cardinals.
Yair Hayut, Menachem Magidor
J. Symb. Log.1
2022 Identity Crisis between supercompactness and VǒPenka's Principle
abstract
Abstract In this paper we study the notion of $C^{(n)}$ -supercompactness introduced by Bagaria in [3] and prove the identity crises phenomenon for such class. Specifically, we show that consistently the least supercompact is strictly below the least $C^{(1)}$ -supercompact but also that the least supercompact is $C^{(1)}$ -supercompact (and even $C^{(n)}$ -supercompact). Furthermore, we prove that under suitable hypothesis the ultimate identity crises is also possible. These results solve several questions posed by Bagaria and Tsaprounis.
Yair Hayut, Menachem Magidor, Alejandro Poveda
J. Symb. Log.1
2021 The Tree Property at the two Immediate Successors of a singular cardinal
abstract
Abstract We present an alternative proof that from large cardinals, we can force the tree property at $\kappa ^+$ and $\kappa ^{++}$ simultaneously for a singular strong limit cardinal $\kappa $ . The advantage of our method is that the proof of the tree property at the double successor is simpler than in the existing literature. This new approach also works to establish the result for $\kappa =\aleph _{\omega ^2}$ .
James Cummings 0001, Yair Hayut, Menachem Magidor, Itay Neeman, Dima Sinapova, Spencer Unger
J. Symb. Log.2
2020 Stationary Reflection
abstract
Abstract We improve the upper bound for the consistency strength of stationary reflection at successors of singular cardinals.
Yair Hayut, Spencer Unger
J. Symb. Log.1
2019 DESTRUCTIBILITY OF THE TREE PROPERTY AT ${\aleph _{\omega + 1}}$
abstract
Abstract We construct a model in which the tree property holds in ${\aleph _{\omega + 1}}$ and it is destructible under $Col\left( {\omega ,{\omega _1}} \right)$ . On the other hand we discuss some cases in which the tree property is indestructible under small or closed forcings.
Yair Hayut, Menachem Magidor
J. Symb. Log.1
2016 Square and Delta reflection
Laura Fontanella, Yair Hayut
Ann. Pure Appl. Log.2
2016 On Foreman's Maximality Principle
abstract
Abstract In this paper, we consider Foreman’s maximality principle, which says that any nontrivial forcing notion either adds a new real or collapses some cardinals. We prove the consistency of some of its consequences. We observe that it is consistent that every c.c.c. forcing adds a real and that for every uncountable regular cardinal κ, every κ-closed forcing of size 2<κ collapses some cardinal.
Mohammad Golshani, Yair Hayut
J. Symb. Log.2