Dan Hathaway

dblp:182/7942 · also Daniel Hathaway · DBLP profile ↗
← Back
8ranked-venue papers
3as first author
3since 2021 · last 2023
0000-0001-6465-0027ORCID · corroborated

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

Theory of computation · 8 · 3 first-author · 3 since 2021
YearPublicationVenuePosition
2023 Applying generic coding with help to uniformizations
Dan Hathaway
Ann. Pure Appl. Log.1
2021 Classes of Barren Extensions
abstract
Abstract 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.2
2021 Generic coding with Help and Amalgamation Failure
abstract
Abstract We show that if M is a countable transitive model of $\text {ZF}$ and if $a,b$ are reals not in M, then there is a G generic over M such that $b \in L[a,G]$ . We then present several applications such as the following: if J is any countable transitive model of $\text {ZFC}$ and $M \not \subseteq J$ is another countable transitive model of $\text {ZFC}$ of the same ordinal height $\alpha $ , then there is a forcing extension N of J such that $M \cup N$ is not included in any transitive model of $\text {ZFC}$ of height $\alpha $ . Also, assuming $0^{\#}$ exists, letting S be the set of reals generic over L, although S is disjoint from the Turing cone above $0^{\#}$ , we have that for any non-constructible real a, $\{ a \oplus s : s \in S \}$ is cofinal in the Turing degrees.
Sy-David Friedman, Dan Hathaway
J. Symb. Log.2
2020 Perfect tree forcings for singular cardinals
Natasha Dobrinen, Dan Hathaway, Karel Prikry
Ann. Pure Appl. Log.2
2020 Forcing and the Halpern-läUchli Theorem
abstract
Abstract 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.2
2017 Disjoint Borel functions
Dan Hathaway
Ann. Pure Appl. Log.1
2017 The Halpern-läUchli Theorem at a Measurable cardinal
abstract
Abstract 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.2
2016 Weak Distributivity implying Distributivity
Dan Hathaway
J. Symb. Log.1