Gabriel Goldberg

dblp:234/5799 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
2since 2021 · last 2024
0000-0002-5777-9305ORCID · corroborated

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

Theory of computation · 3 · 3 first-author · 2 since 2021
YearPublicationVenuePosition
2024 Measurable cardinals and choiceless axioms
abstract
Kunen refuted the existence of an elementary embedding from the universe of sets to itself assuming the Axiom of Choice. This paper concerns the ramifications of this hypothesis when the Axiom of Choice is not assumed. For example, the existence of such an embedding implies that there is a proper class of cardinals λ such that λ + is measurable.
Gabriel Goldberg
Ann. Pure Appl. Log.1
2021 Rank-to-Rank Embeddings and steel's Conjecture
abstract
Abstract This paper establishes a conjecture of Steel [7] regarding the structure of elementary embeddings from a level of the cumulative hierarchy into itself. Steel’s question is related to the Mitchell order on these embeddings, studied in [5] and [7]. Although this order is known to be illfounded, Steel conjectured that it has certain large wellfounded suborders, which is what we establish. The proof relies on a simple and general analysis of the much broader class of extender embeddings and a variant of the Mitchell order called the internal relation.
Gabriel Goldberg
J. Symb. Log.1
2020 The Ketonen order
abstract
Abstract We study a partial order on countably complete ultrafilters introduced by Ketonen [2] as a generalization of the Mitchell order. The following are our main results: the order is wellfounded; its linearity is equivalent to the Ultrapower Axiom, a principle introduced in the author’s dissertation [1]; finally, assuming the Ultrapower Axiom, the Ketonen order coincides with Lipschitz reducibility in the sense of generalized descriptive set theory.
Gabriel Goldberg
J. Symb. Log.1