VLDB 2026 Research / reviewers in the wild / expert
Natasha Dobrinen
dblp:06/2039
· DBLP profile ↗
12ranked-venue papers
9as first author
2since 2021 · last 2025
0000-0001-6360-0001ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 12 · 9 first-author · 2 since 2021
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Cofinal Types of Ultrafilters over Measurable CardinalsabstractAbstract We develop the theory of cofinal types of ultrafilters over measurable cardinals and establish its connections to Galvin’s property. We generalize fundamental results from the countable to the uncountable, but often in surprisingly strengthened forms, and present models with varying structures of the cofinal types of ultrafilters over measurable cardinals. Tom Benhamou, Natasha Dobrinen |
J. Symb. Log. | 2 |
| 2021 | Classes of Barren ExtensionsabstractAbstract Henle, Mathias, and Woodin proved in [21] that, provided that ${\omega }{\rightarrow }({\omega })^{{\omega }}$ holds in a modelMof ZF, then forcing with $([{\omega }]^{{\omega }},{\subseteq }^*)$ overMadds no new sets of ordinals, thus earning the name a “barren” extension. Moreover, under an additional assumption, they proved that this generic extension preserves all strong partition cardinals. This forcing thus produces a model $M[\mathcal {U}]$ , where $\mathcal {U}$ is a Ramsey ultrafilter, with many properties of the original modelM. This begged the question of how important the Ramseyness of $\mathcal {U}$ is for these results. In this paper, we show that several classes of $\sigma $ -closed forcings which generate non-Ramsey ultrafilters have the same properties. Such ultrafilters include Milliken–Taylor ultrafilters, a class of rapid p-points of Laflamme,k-arrow p-points of Baumgartner and Taylor, and extensions to a class of ultrafilters constructed by Dobrinen, Mijares, and Trujillo. Furthermore, the class of Boolean algebras $\mathcal {P}({\omega }^{{\alpha }})/{\mathrm {Fin}}^{\otimes {\alpha }}$ , $2\le {\alpha }<{\omega }_1$ , forcing non-p-points also produce barren extensions. Natasha Dobrinen, Dan Hathaway |
J. Symb. Log. | 1 |
| 2020 | Perfect tree forcings for singular cardinals
Natasha Dobrinen, Dan Hathaway, Karel Prikry |
Ann. Pure Appl. Log. | 1 |
| 2020 | Forcing and the Halpern-läUchli TheoremabstractAbstract We investigate the effects of various forcings on several forms of the Halpern– Läuchli theorem. For inaccessible κ, we show they are preserved by forcings of size less than κ. Combining this with work of Zhang in [17] yields that the polarized partition relations associated with finite products of the κ-rationals are preserved by all forcings of size less than κ over models satisfying the Halpern– Läuchli theorem at κ. We also show that the Halpern–Läuchli theorem is preserved by <κ-closed forcings assuming κ is measurable, following some observed reflection properties. Natasha Dobrinen, Dan Hathaway |
J. Symb. Log. | 1 |
| 2017 | The Halpern-läUchli Theorem at a Measurable cardinalabstractAbstract Several variants of the Halpern–Läuchli Theorem for trees of uncountable height are investigated. Forκweakly compact, we prove that the various statements are all equivalent, and hence, the strong tree version holds for one tree on any weakly compact cardinal. For any finited≥ 2, we prove the consistency of the Halpern–Läuchli Theorem ondmany normalκ-trees at a measurable cardinalκ, given the consistency of aκ+d-strong cardinal. This follows from a more general consistency result at measurableκ, which includes the possibility of infinitely many trees, assuming partition relations which hold in models of AD. Natasha Dobrinen, Dan Hathaway |
J. Symb. Log. | 1 |
| 2016 | High Dimensional Ellentuck Spaces and initial Chains in the Tukey Structure of non-P-PointsabstractAbstract The generic ultrafilter ${\cal G}_2 $ forced by ${\cal P}\left( {\omega \times \omega } \right)/\left( {{\rm{Fin}} \otimes {\rm{Fin}}} \right)$ was recently proved to be neither maximum nor minimum in the Tukey order of ultrafilters ([1]), but it was left open where exactly in the Tukey order it lies. We prove ${\cal G}_2 $ that is in fact Tukey minimal over its projected Ramsey ultrafilter. Furthermore, we prove that for each ${\cal G}_2 $ , the collection of all nonprincipal ultrafilters Tukey reducible to the generic ultrafilter ${\cal G}_k $ forced by ${\cal P}\left( {\omega ^k } \right)/{\rm{Fin}}^{ \otimes k} $ forms a chain of lengthk. Essential to the proof is the extraction of a dense subsetεkfrom (Fin⊗k)+which we prove to be a topological Ramsey space. The spacesεk,k≥ 2, form a hierarchy of high dimensional Ellentuck spaces. New Ramsey-classification theorems for equivalence relations on fronts on εkare proved, extending the Pudlák–Rödl Theorem for fronts on the Ellentuck space, which are applied to find the Tukey and Rudin–Keisler structures below ${\cal G}_k $ . Natasha Dobrinen |
J. Symb. Log. | 1 |
| 2015 | The Next Best Thing to a P-PointabstractAbstract We study ultrafilters onω2produced by forcing with the quotient of ${\cal P}$ (ω2) by the Fubini square of the Fréchet filter onω. We show that such an ultrafilter is a weak P-point but not a P-point and that the only nonprincipal ultrafilters strictly below it in the Rudin–Keisler order are a single isomorphism class of selective ultrafilters. We further show that it enjoys the strongest square-bracket partition relations that are possible for a non-P-point. We show that it is not basically generated but that it shares with basically generated ultrafilters the property of not being at the top of the Tukey ordering. In fact, it is not Tukey-above [ω1]<ω, and it has only continuum many ultrafilters Tukey-below it. A tool in our proofs is the analysis of similar (but not the same) properties for ultrafilters obtained as the sum, over a selective ultrafilter, of nonisomorphic selective ultrafilters. Andreas Blass, Natasha Dobrinen, Dilip Raghavan |
J. Symb. Log. | 2 |
| 2008 | kappa-stationary subsets of kappa +lambda, infinitary games, and distributive laws in Boolean algebrasabstractAbstract We characterize the (κ, λ, < μ)-distributive law in Boolean algebras in terms of cut and choose games , when μ ≤ κ ≤ λ and κ<κ = κ. This builds on previous work to yield game-theoretic characterizations of distributive laws for almost all triples of cardinals κ, λ, μ with μ ≤ λ, under GCH. In the case when μ ≤ κ ≤ λ and κ<κ = κ, we show that it is necessary to consider whether the κ-stationarity of in the ground model is preserved by . In this vein, we develop the theory of κ-club and κ-stationary subsets of . We also construct Boolean algebras in which Player I wins but the (κ, ∞, κ)-d.1. holds, and, assuming GCH, construct Boolean algebras in which many games are undetermined. Natasha Dobrinen |
J. Symb. Log. | 1 |
| 2008 | Internal consistency and global co-stationarity of the ground modelabstractAbstract Global co-stationarity of the ground model from an ℵ2-c.c. forcing which adds a new subset of ℵ1 is internally consistent relative to an ω1-Erdős hyperstrong cardinal and a sufficiently large measurable above. Natasha Dobrinen, Sy-David Friedman |
J. Symb. Log. | 1 |
| 2007 | The hyper-weak distributive law and a related game in Boolean algebras
James Cummings 0001, Natasha Dobrinen |
Ann. Pure Appl. Log. | 2 |
| 2006 | Co-stationarity of the ground modelabstractAbstract This paper investigates when it is possible for a partial ordering ℙ to force Pk(Λ)\V to be stationary in Vℙ. It follows from a result of Gitik that whenever ℙ adds a new real, then Pk(Λ)\V is stationary in Vℙ for each regular uncountable cardinal κ in Vℙ and all cardinals λ ≥ κ in Vℙ [4], However, a covering theorem of Magidor implies that when no new ω-sequences are added, large cardinals become necessary [7]. The following is equiconsistent with a proper class of ω1-Erdős cardinals: If ℙ is ℵ1-Cohen forcing, then Pk(Λ)\V is stationary in Vℙ, for all regular κ ≥ ℵ2and all λ ≩ κ. The following is equiconsistent with an ω1-Erdős cardinal: If ℙ is ℵ1-Cohen forcing, then is stationary in Vℙ. The following is equiconsistent with κ measurable cardinals: If ℙ is κ-Cohen forcing, then is stationary in Vℙ. Natasha Dobrinen, Sy-David Friedman |
J. Symb. Log. | 1 |
| 2004 | Almost everywhere dominationabstractAbstract. A Turing degree a is said to be almost everywhere dominating if, for almost all X ∈ 2ω with respect to the “fair coin” probability measure on 2ω, and for all g: ω → ω Turing reducible to X, there exists f: ω → ω of Turing degree a which dominates g. We study the problem of characterizing the almost everywhere dominating Turing degrees and other, similarly defined classes of Turing degrees. We relate this problem to some questions in the reverse mathematics of measure theory. Natasha Dobrinen, Stephen G. Simpson |
J. Symb. Log. | 1 |