•  101
    With infinite utility, more needn't be better
    Australasian Journal of Philosophy 78 (2). 2000.
    This Article does not have an abstract
  •  20
    The halting problem is almost always decidable
    with Alexei Miasnikov
    Notre Dame Journal of Formal Logic 47 (4): 515-524. 2006.
  •  35
    What is the theory without power set?
    with Victoria Gitman and Thomas A. Johnstone
    Mathematical Logic Quarterly 62 (4-5): 391-406. 2016.
    We show that the theory, consisting of the usual axioms of but with the power set axiom removed—specifically axiomatized by extensionality, foundation, pairing, union, infinity, separation, replacement and the assertion that every set can be well‐ordered—is weaker than commonly supposed and is inadequate to establish several basic facts often desired in its context. For example, there are models of in which ω1 is singular, in which every set of reals is countable, yet ω1 exists, in which there a…Read more
  •  33
    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
  •  20
    Infinite time Turing machines
    with Andy Lewis
    Journal of Symbolic Logic 65 (2): 567-604. 2000.
    We extend in a natural way the operation of Turing machines to infinite ordinal time, and investigate the resulting supertask theory of computability and decidability on the reals. Everyset. for example, is decidable by such machines, and the semi-decidable sets form a portion of thesets. Our oracle concept leads to a notion of relative computability for sets of reals and a rich degree structure, stratified by two natural jump operators.
  •  226
    Gap forcing: Generalizing the lévy-Solovay theorem
    Bulletin of Symbolic Logic 5 (2): 264-272. 1999.
    The Lévy-Solovay Theorem [8] limits the kind of large cardinal embeddings that can exist in a small forcing extension. Here I announce a generalization of this theorem to a broad new class of forcing notions. One consequence is that many of the forcing iterations most commonly found in the large cardinal literature create no new weakly compact cardinals, measurable cardinals, strong cardinals, Woodin cardinals, strongly compact cardinals, supercompact cardinals, almost huge cardinals, huge cardi…Read more
  •  5
    A Simple Maximality Principle
    Journal of Symbolic Logic 68 (2): 527-550. 2003.
    In this paper, following an idea of Christophe Chalons, I propose a new kind of forcing axiom, the Maximality Principle, which asserts that any sentence φ holding in some forcing extension $V\P$ and all subsequent extensions V\P*\Qdot holds already in V. It follows, in fact, that such sentences must also hold in all forcing extensions of V. In modal terms, therefore, the Maximality Principle is expressed by the scheme $\implies\necessaryφ$, and is equivalent to the modal theory S5. In this artic…Read more
  •  57
    The Wholeness Axioms and V=HOD
    Archive for Mathematical Logic 40 (1): 1-8. 2001.
    If the Wholeness Axiom wa $_0$ is itself consistent, then it is consistent with v=hod. A consequence of the proof is that the various Wholeness Axioms are not all equivalent. Additionally, the theory zfc+wa $_0$ is finitely axiomatizable
  •  57
    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
  •  73
    New inconsistencies in infinite utilitarianism: Is every world good, bad or neutral?
    with Donniell Fishkind and Barbara Montero
    Australasian Journal of Philosophy 80 (2). 2002.
    In the context of worlds with infinitely many bearers of utility, we argue that several collections of natural Utilitarian principles--principles which are certainly true in the classical finite Utilitarian context and which any Utilitarian would find appealing--are inconsistent.
  • Pf= NPf almost everywhere
    with P. D. Welch
    Mathematical Logic Quarterly 49 (5): 536-540. 2003.
  •  96
    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
  •  360
    Infinite time Turing machines
    Minds and Machines 12 (4): 567-604. 2002.
    Infinite time Turing machines extend the operation of ordinary Turing machines into transfinite ordinal time. By doing so, they provide a natural model of infinitary computability, a theoretical setting for the analysis of the power and limitations of supertask algorithms.
  •  61
    Destruction or preservation as you like it
    Annals of Pure and Applied Logic 91 (2-3): 191-229. 1998.
    The Gap Forcing Theorem, a key contribution of this paper, implies essentially that after any reverse Easton iteration of closed forcing, such as the Laver preparation, every supercompactness measure on a supercompact cardinal extends a measure from the ground model. Thus, such forcing can create no new supercompact cardinals, and, if the GCH holds, neither can it increase the degree of supercompactness of any cardinal; in particular, it can create no new measurable cardinals. In a crescendo of …Read more
  •  46
    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
  •  55
    The lottery preparation
    Annals of Pure and Applied Logic 101 (2-3): 103-146. 2000.
    The lottery preparation, a new general kind of Laver preparation, works uniformly with supercompact cardinals, strongly compact cardinals, strong cardinals, measurable cardinals, or what have you. And like the Laver preparation, the lottery preparation makes these cardinals indestructible by various kinds of further forcing. A supercompact cardinal κ, for example, becomes fully indestructible by
  •  34
    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
  •  28
    Resurrection axioms and uplifting cardinals
    with Thomas A. Johnstone
    Archive for Mathematical Logic 53 (3-4): 463-485. 2014.
    We introduce the resurrection axioms, a new class of forcing axioms, and the uplifting cardinals, a new large cardinal notion, and prove that various instances of the resurrection axioms are equiconsistent over ZFC with the existence of an uplifting cardinal.
  •  37
    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