Monroe Eskew

dblp:186/0188 · DBLP profile ↗
← Back
4ranked-venue papers
4as first author
3since 2021 · last 2024
0000-0001-8094-9731ORCID · corroborated

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

Theory of computation · 4 · 4 first-author · 3 since 2021
YearPublicationVenuePosition
2024 Weak saturation properties and side conditions
abstract
Towards combining “compactness” and “hugeness” properties at ω2, we investigate the relevance of side-conditions forcing. We reduce the upper bound on the consistency strength of the weak Chang's Conjecture at ω2 using Neeman's forcing. On the other hand, we find a barrier to the applicability of these methods to our problem and give a counterexample to a claim of Neeman about the effects of iterating such forcing.
Monroe Eskew
Ann. Pure Appl. Log.1
2024 Mutually embeddable models of ZFC
abstract
We investigate systems of transitive models of ZFC which are elementarily embeddable into each other and the influence of definability properties on such systems.
Monroe Eskew, Sy-David Friedman, Yair Hayut, Farmer Schlutzenberg
Ann. Pure Appl. Log.1
2022 Embeddings Into Outer Models
abstract
Abstract We explore the possibilities for elementary embeddings $j : M \to N$ , where M and N are models of ZFC with the same ordinals, $M \subseteq N$ , and N has access to large pieces of j. We construct commuting systems of such maps between countable transitive models that are isomorphic to various canonical linear and partial orders, including the real line ${\mathbb R}$ .
Monroe Eskew, Sy-David Friedman
J. Symb. Log.1
2016 Dense ideals and Cardinal Arithmetic
abstract
Abstract From large cardinals we show the consistency of normal, fine, κ-complete λ-dense ideals on ${{\cal P}_\kappa }\left( \lambda \right)$ for successor κ. We explore the interplay between dense ideals, cardinal arithmetic, and squares, answering some open questions of Foreman.
Monroe Eskew
J. Symb. Log.1