Spencer Unger

dblp:117/2553 · DBLP profile ↗
← Back
10ranked-venue papers
3as first author
2since 2021 · last 2024
—ORCID · none

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

Theory of computation · 10 · 3 first-author · 2 since 2021
YearPublicationVenuePosition
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.3
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.6
2020 Diagonal supercompact Radin forcing
Omer Ben-Neria, Chris Lambie-Hanson, Spencer Unger
Ann. Pure Appl. Log.3
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.2
2018 THE TREE PROPERTY AT ${\aleph _{{\omega ^2} + 1}}$ AND ${\aleph _{{\omega ^2} + 2}}$
abstract
Abstract We show that from large cardinals it is consistent to have the tree property simultaneously at ${\aleph _{{\omega ^2} + 1}}$ and ${\aleph _{{\omega ^2} + 2}}$ with ${\aleph _{{\omega ^2}}}$ strong limit.
Dima Sinapova, Spencer Unger
J. Symb. Log.2
2016 The tree property below ℵω⋅2
abstract
We improve the best known result on successive regular cardinals with the tree property. In particular we prove that relative to an increasing ω + ω -sequence of supercompact cardinals it is consistent that every regular cardinal on the interval [ ℵ 2 , ℵ ω ⋅ 2 ) has the tree property.
Spencer Unger
Ann. Pure Appl. Log.1
2016 Modified Extender based forcing
abstract
Abstract We analyze the modified extender based forcing from Assaf Sharon’s PhD thesis. We show there is a bad scale in the extension and therefore weak square fails. We also present two metatheorems which give a rough characterization of when a diagonal Prikry-type forcing forces the failure of weak square.
Dima Sinapova, Spencer Unger
J. Symb. Log.2
2015 Fragility and indestructibility II
Spencer Unger
Ann. Pure Appl. Log.1
2014 Combinatorics at אω
Dima Sinapova, Spencer Unger
Ann. Pure Appl. Log.2
2014 A model of Cummings and Foreman revisited
Spencer Unger
Ann. Pure Appl. Log.1