[bibtex key=GitmanHamkins2010:NaturalModelOfMultiverseAxioms]
In this article, we prove that if ZFC is consistent, then the collection of countable computably saturated models of ZFC satisfies all of the Multiverse Axioms that I introduced in my paper, “The set-theoretic multiverse.”
[bibtex key=HamkinsJohnstone2010:IndestructibleStrongUnfoldability]
Using the lottery preparation, we prove that any strongly unfoldable cardinal $\kappa$ can be made indestructible by all ${\lt}\kappa$-closed + $\kappa^+$-preserving forcing. This degree of indestructibility, we prove, is the best possible from this hypothesis within the class of ${\lt}\kappa$-closed forcing. From a stronger hypothesis, however, we prove that the strong unfoldability of $\kappa$ can be made indestructible by all ${\lt}\kappa$-closed forcing. Such indestructibility, we prove, does not follow from indestructibility merely by ${\lt}\kappa$-directed closed forcing. Finally, we obtain global and universal forms of indestructibility for strong unfoldability, finding the exact consistency strength of universal indestructibility for strong unfoldability.
[bibtex key=Hamkins2009:SomeSecondOrderSetTheory]
[bibtex key=HamkinsMiller2009:PostsProblemForORMsExplicitApproach]
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.
[bibtex key=FuchsHamkins2009:DegreesOfRigidity]
We investigate various strong notions of rigidity for Souslin trees, separating them under Diamond into a hierarchy. Applying our methods to the automorphism tower problem in group theory, we show under Diamond that there is a group whose automorphism tower is highly malleable by forcing.
[bibtex key=Hamkins2009:TallCardinals]
A cardinal $\kappa$ is tall if for every ordinal $\theta$ there is an embedding $j:V\to M$ with critical point $\kappa$ such that $j(\kappa)\gt\theta$ and $M^\kappa\subset 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 $\kappa$ can be made indestructible by a variety of forcing notions, including forcing that pumps up the value of $2^\kappa$ as high as desired.
[bibtex key=HamkinsJohnstone2009:PFA(aleph_2-preserving)]
We prove that the PFA lottery preparation of a strongly unfoldable cardinal $\kappa$ under $\neg 0^\sharp$ forces $\text{PFA}(\aleph_2\text{-preserving})$, $\text{PFA}(\aleph_3\text{-preserving})$ and $\text{PFA}_{\aleph_2}$, with $2^\omega=\kappa=\aleph_2$. The method adapts to semi-proper forcing, giving $\text{SPFA}(\aleph_2\text{-preserving})$, $\text{SPFA}(\aleph_3\text{-preserving})$ and $\text{SPFA}_{\aleph_2}$ from the same hypothesis. It follows by a result of Miyamoto that the existence of a strongly unfoldable cardinal is equiconsistent with the conjunction $\text{SPFA}(\aleph_2\text{-preserving})+\text{SPFA}(\aleph_3\text{-preserving})+\text{SPFA}_{\aleph_2}+2^\omega=\aleph_2$. Since unfoldable cardinals are relatively weak as large cardinal notions, our summary conclusion is that in order to extract significant strength from PFA or SPFA, one must collapse $\aleph_3$ to $\aleph_1$.
[bibtex key=HamkinsMillerSeaboldWarner2007:InfiniteTimeComputableModelTheory]
We introduce infinite time computable model theory, the computable model theory arising with infinite time Turing machines, which provide infinitary notions of computability for structures built on the reals $\mathbb{R}$. Much of the finite time theory generalizes to the infinite time context, but several fundamental questions, including the infinite time computable analogue of the Completeness Theorem, turn out to be independent of ZFC.
[bibtex key=FuchsHamkins2008:ChangingHeightsOverL]
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.
In an earlier paper with Simon Thomas, “Changing the heights of automorphism towers,” we had added such malleable groups by forcing, and the current paper addresses the question as to whether there are such groups already in L.
[bibtex key=HamkinsReitzWoodin2008:TheGroundAxiomAndVequalsHOD]
Abstract. The Ground Axiom asserts that the universe is not a nontrivial set-forcing extension of any inner model. Despite the apparent second-order nature of this assertion, it is first-order expressible in set theory. The previously known models of the Ground Axiom all satisfy strong forms of $V=\text{HOD}$. In this article, we show that the Ground Axiom is relatively consistent with $V\neq\text{HOD}$. In fact, every model of ZFC has a class-forcing extension that is a model of $\text{ZFC}+\text{GA}+V\neq\text{HOD}$. The method accommodates large cardinals: every model of ZFC with a supercompact cardinal, for example, has a class-forcing extension with $\text{ZFC}+\text{GA}+V\neq\text{HOD}$ in which this supercompact cardinal is preserved.
[bibtex key=HamkinsLoewe2008:TheModalLogicOfForcing]
Joel David Hamkins, Benedikt Löwe, The modal logic of forcing, Transactions of the American Mathematical Society, 2008, 360(4):1793-1817, DOI:10.1090/S0002-9947-07-04297-3.
Abstract. What are the most general principles in set theory relating forceability and truth? As with Solovay’s celebrated analysis of provability, both this question and its answer are naturally formulated with modal logic. We aim to do for forceability what Solovay did for provability. A set theoretical assertion $\psi$ is forceable or possible, if $\psi$ holds in some forcing extension, and necessary, if $\psi$ holds in all forcing extensions. In this forcing interpretation of modal logic, we establish that if ZFC is consistent, then the ZFC-provable principles of forcing are exactly those in the modal theory known as S4.2.
Follow-up article: Structural connections between a forcing class and its modal logic
[bibtex key=ApterCummingsHamkins2006:LargeCardinalsWithFewMeasures]
We show, assuming the consistency of one measurable cardinal, that it is consistent for there to be exactly $\kappa^+$ many normal measures on the least measurable cardinal $\kappa$. This answers a question of Stewart Baldwin. The methods generalize to higher cardinals, showing that the number of $\lambda$-strong compactness or $\lambda$-supercompactness measures on $P_\kappa(\lambda)$ can be exactly $\lambda^+$, if $\lambda>\kappa$ is a regular cardinal. We conclude with a list of open questions. Our proofs use a critical observation due to James Cummings.
[bibtex key=Hamkins2007:ASurveyOfInfiniteTimeTuringMachines]
Infinite time Turing machines extend the operation of ordinary Turing machines into transfinite ordinal time, thereby providing a natural model of infinitary computability, with robust notions of computability and decidability on the reals, while remaining close to classical concepts of computability. Here, I survey the theory of infinite time Turing machines and recent developments. These include the rise of infinite time complexity theory, the introduction of infinite time computable model theory, the study of the infinite time analogue of Borel equivalence relation theory, and the introduction of new ordinal computational models. The study of infinite time Turing machines increasingly relies on the interaction of methods from set theory, descriptive set theory and computability theory.
[bibtex key=HamkinsLinetskyMiller2007:ComplexityOfQuicklyDecidableORMSets]
The Ordinal Register Machine (ORM) is one of several different machine models for infinitary computability. We classify, by complexity, the sets that can be decided quickly by ORMs. In particular, we show that the arithmetical sets are exactly those sets that can be decided by ORMs in times uniformly less than $\omega^\omega$. Further, we show that the hyperarithmetical sets are exactly those sets that can be decided by an ORM in time uniformly less than $\omega_1^{CK}$.
[bibtex key=HamkinsMiller2007:PostsProblemForORMs]
We study Post’s Problem for ordinal register machines, showing that its general solution is positive, but that any set of ordinals solving it must be unbounded in the writable ordinals. This mirrors earlier results for infinite-time Turing machines, and also provides insight into the different methods required for register machines and Turing machines in infinite time.