University of California, Berkeley
Mathematics
PhD, 1994
CV
Oxford, England, United Kingdom of Great Britain and Northern Ireland
  •  180
    With infinite utility, more needn't be better
    Australasian Journal of Philosophy 78 (2). 2000.
    This Article does not have an abstract
  •  301
    Exactly controlling the non-supercompact strongly compact cardinals
    with Arthur W. Apter
    Journal of Symbolic Logic 68 (2): 669-688. 2003.
    We summarize the known methods of producing a non-supercompact strongly compact cardinal and describe some new variants. Our Main Theorem shows how to apply these methods to many cardinals simultaneously and exactly control which cardinals are supercompact and which are only strongly compact in a forcing extension. Depending upon the method, the surviving non-supercompact strongly compact cardinals can be strong cardinals, have trivial Mitchell rank or even contain a club disjoint from the set o…Read more
  •  195
    Small forcing makes any cardinal superdestructible
    Journal of Symbolic Logic 63 (1): 51-58. 1998.
    Small forcing always ruins the indestructibility of an indestructible supercompact cardinal. In fact, after small forcing, any cardinal κ becomes superdestructible--any further
  •  137
    Fragile measurability
    Journal of Symbolic Logic 59 (1): 262-282. 1994.
    Laver [L] and others [G-S] have shown how to make the supercompactness or strongness of κ indestructible by a wide class of forcing notions. We show, alternatively, how to make these properties fragile. Specifically, we prove that it is relatively consistent that any forcing which preserves $\kappa^{
  •  99
    Changing the Heights of Automorphism Towers by Forcing with Souslin Trees over L
    with Gunter Fuchs
    Journal of Symbolic Logic 73 (2). 2008.
    We prove that there are groups in the constructible universe whose automorphism towers are highly malleable by forcing. This is a consequence of the fact that, under a suitable diamond hypothesis, there are sufficiently many highly rigid non-isomorphic Souslin trees whose isomorphism relation can be precisely controlled by forcing
  •  107
    The least weakly compact cardinal can be unfoldable, weakly measurable and nearly $${\theta}$$ θ -supercompact
    with Brent Cody, Moti Gitik, and Jason A. Schanker
    Archive for Mathematical Logic 54 (5-6): 491-510. 2015.
    We prove from suitable large cardinal hypotheses that the least weakly compact cardinal can be unfoldable, weakly measurable and even nearly θ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\theta}$$\end{document}-supercompact, for any desired θ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} …Read more
  •  502
    The set-theoretic multiverse
    Review of Symbolic Logic 5 (3): 416-449. 2012.
    The multiverse view in set theory, introduced and argued for in this article, is the view that there are many distinct concepts of set, each instantiated in a corresponding set-theoretic universe. The universe view, in contrast, asserts that there is an absolute background set concept, with a corresponding absolute set-theoretic universe in which every set-theoretic question has a definite answer. The multiverse position, I argue, explains our experience with the enormous range of set-theoretic …Read more
  •  82
    Post’s Problem for ordinal register machines: An explicit approach
    with Russell G. Miller
    Annals of Pure and Applied Logic 160 (3): 302-309. 2009.
    We provide a positive solution for Post’s Problem for ordinal register machines, and also prove that these machines and ordinal Turing machines compute precisely the same partial functions on ordinals. To do so, we construct ordinal register machine programs which compute the necessary functions. In addition, we show that any set of ordinals solving Post’s Problem must be unbounded in the writable ordinals
  •  228
    Is the Dream Solution of the Continuum Hypothesis Attainable?
    Notre Dame Journal of Formal Logic 56 (1): 135-145. 2015.
    The dream solution of the continuum hypothesis would be a solution by which we settle the continuum hypothesis on the basis of a newly discovered fundamental principle of set theory, a missing axiom, widely regarded as true. Such a dream solution would indeed be a solution, since we would all accept the new axiom along with its consequences. In this article, however, I argue that such a dream solution to $\mathrm {CH}$ is unattainable
  •  101
    Changing the heights of automorphism towers
    Annals of Pure and Applied Logic 102 (1-2): 139-157. 2000.
    If G is a centreless group, then τ denotes the height of the automorphism tower of G. We prove that it is consistent that for every cardinal λ and every ordinal α
  •  196
    Degrees of rigidity for Souslin trees
    with Gunter Fuchs
    Journal of Symbolic Logic 74 (2): 423-454. 2009.
    We investigate various strong notions of rigidity for Souslin trees, separating them under ♢ into a hierarchy. Applying our methods to the automorphism tower problem in group theory, we show under ♢ that there is a group whose automorphism tower is highly malleable by forcing
  •  152
    The Halting Problem Is Decidable on a Set of Asymptotic Probability One
    with Alexei Miasnikov
    Notre Dame Journal of Formal Logic 47 (4): 515-524. 2006.
    The halting problem for Turing machines is decidable on a set of asymptotic probability one. The proof is sensitive to the particular computational models
  •  301
    Indestructibility and the level-by-level agreement between strong compactness and supercompactness
    with Arthur W. Apter
    Journal of Symbolic Logic 67 (2): 820-840. 2002.
    Can a supercompact cardinal κ be Laver indestructible when there is a level-by-level agreement between strong compactness and supercompactness? In this article, we show that if there is a sufficiently large cardinal above κ, then no, it cannot. Conversely, if one weakens the requirement either by demanding less indestructibility, such as requiring only indestructibility by stratified posets, or less level-by-level agreement, such as requiring it only on measure one sets, then yes, it can.
  •  109
    Tall cardinals
    Mathematical Logic Quarterly 55 (1): 68-86. 2009.
    A cardinal κ is tall if for every ordinal θ there is an embedding j: V → M with critical point κ such that j > θ and Mκ ⊆ M. Every strong cardinal is tall and every strongly compact cardinal is tall, but measurable cardinals are not necessarily tall. It is relatively consistent, however, that the least measurable cardinal is tall. Nevertheless, the existence of a tall cardinal is equiconsistent with the existence of a strong cardinal. Any tall cardinal κ can be made indestructible by a variety o…Read more
  •  242
    Pointwise definable models of set theory
    with David Linetsky and Jonas Reitz
    Journal of Symbolic Logic 78 (1): 139-156. 2013.
    A pointwise definable model is one in which every object is \loos definable without parameters. In a model of set theory, this property strengthens $V=\HOD$, but is not first-order expressible. Nevertheless, if \ZFC\ is consistent, then there are continuum many pointwise definable models of \ZFC. If there is a transitive model of \ZFC, then there are continuum many pointwise definable transitive models of \ZFC. What is more, every countable model of \ZFC\ has a class forcing extension that is po…Read more