Dima Sinapova

dblp:89/6894 · DBLP profile ↗
← Back
8ranked-venue papers
6as first author
1since 2021 · last 2021
—ORCID · none

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

Theory of computation · 8 · 6 first-author · 1 since 2021
YearPublicationVenuePosition
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.5
2019 Itp, ISP, and SCH
abstract
Abstract $ISP$ cannot hold at the first or second successor of a singular strong limit of countable cofinality; on the other hand, we force a failure of “strong ${\rm{SCH}}$ ” across a cardinal where $ITP$ holds. We also show that $ITP$ does not imply that there are stationary many internally unbounded models.
Sherwood Hachtman, Dima Sinapova
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.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.1
2014 Combinatorics at אω
Dima Sinapova, Spencer Unger
Ann. Pure Appl. Log.1
2012 The tree property at ℵω+1
abstract
Abstract We show that givenωmany supercompact cardinals, there is a generic extension in which there are no Aronszajn trees at ℵω+1·This is an improvement of the large cardinal assumptions. The previous hypothesis was a huge cardinal andωmany supercompact cardinals above it, in Magidor–Shelah [7].
Dima Sinapova
J. Symb. Log.1
2012 The tree property and the failure of the Singular Cardinal Hypothesis at ℵω2
abstract
Abstract We show that givenωmany supercompact cardinals, there is a generic extension in which the tree property holds at ℵω2+ 1and the SCH fails at ℵω2.
Dima Sinapova
J. Symb. Log.1
2008 A model for a very good scale and a bad scale
abstract
Abstract Given a supercompact cardinalκand a regular cardinalλ<κ, we describe a type of forcing such that in the generic extension the cofinality ofκisλ, there is a very good scale atκ, a bad scale atκ, and SCH atκfails. When creating our model we have great freedom in assigning the value of 2κ, and so we can make SCH hold or fail arbitrarily badly.
Dima Sinapova
J. Symb. Log.1