![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Yair Hayut
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j17]Monroe Eskew
, Sy-David Friedman, Yair Hayut, Farmer Schlutzenberg:
Mutually embeddable models of ZFC. Ann. Pure Appl. Log. 175(Issue 1, Part B): 103325 (2024) - [j16]Omer Ben-Neria
, Yair Hayut
, Spencer Unger:
Stationary Reflection and the Failure of the SCH. J. Symb. Log. 89(1): 1-26 (2024) - 2023
- [j15]Yair Hayut, David Lehavi
:
Complete \({\boldsymbol{SE(3)}}\) Invariants for a Comeagre Set of \({\boldsymbol{C^3}}\) Compact Orientable Surfaces in \(\mathbb{R}^{\boldsymbol{3}}\). SIAM J. Appl. Algebra Geom. 7(2): 311-344 (2023) - 2022
- [j14]Yair Hayut, Menachem Magidor, Alejandro Poveda:
Identity Crisis between supercompactness and VǒPenka's Principle. J. Symb. Log. 87(2): 626-648 (2022) - [j13]Yair Hayut
, Menachem Magidor:
Subcompact Cardinals, Type Omission, and ladder Systems. J. Symb. Log. 87(3): 1111-1129 (2022) - [j12]Shimon Garti
, Yair Hayut, Haim Horowitz, Menachem Magidor:
Forcing axioms and the Galvin number. Period. Math. Hung. 84(2): 250-258 (2022) - 2021
- [j11]James Cummings
, Yair Hayut, Menachem Magidor, Itay Neeman, Dima Sinapova, Spencer Unger:
The Tree Property at the two Immediate Successors of a singular cardinal. J. Symb. Log. 86(2): 600-608 (2021) - 2020
- [j10]Mohammad Golshani, Yair Hayut
:
The special Aronszajn tree property. J. Math. Log. 20(1): 2050003 (2020) - [j9]Yair Hayut, Spencer Unger:
Stationary Reflection. J. Symb. Log. 85(3): 937-959 (2020)
2010 – 2019
- 2019
- [j8]Yair Hayut
, Menachem Magidor:
DESTRUCTIBILITY OF THE TREE PROPERTY AT ${\aleph _{\omega + 1}}$. J. Symb. Log. 84(2): 621-631 (2019) - [j7]Shimon Garti
, Yair Hayut
:
The first omitting cardinal for Magidority. Math. Log. Q. 65(1): 95-104 (2019) - 2017
- [j6]Yair Hayut
:
Magidor-Malitz reflection. Arch. Math. Log. 56(3-4): 253-272 (2017) - [j5]Yair Hayut
, Chris Lambie-Hanson
:
Simultaneous stationary reflection and square sequences. J. Math. Log. 17(2): 1750010:1-1750010:27 (2017) - [j4]Yair Hayut
, Spencer Unger:
The strong tree property and weak square. Math. Log. Q. 63(1-2): 150-154 (2017) - 2016
- [j3]Yair Hayut
, Asaf Karagila
:
Restrictions on forcings that change cofinalities. Arch. Math. Log. 55(3-4): 373-384 (2016) - [j2]Laura Fontanella, Yair Hayut
:
Square and Delta reflection. Ann. Pure Appl. Log. 167(8): 663-683 (2016) - [j1]Mohammad Golshani, Yair Hayut
:
On Foreman's Maximality Principle. J. Symb. Log. 81(4): 1344-1356 (2016)
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint