[bibtex key=Hamkins2009:SomeSecondOrderSetTheory]
Tag Archives: forcing
Degrees of rigidity for Souslin trees
[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.
Tall cardinals
[bibtex key=Hamkins2009:TallCardinals]
A cardinal
The proper and semi-proper forcing axioms for forcing notions that preserve ℵ 2 or ℵ 3
[bibtex key=HamkinsJohnstone2009:PFA(aleph_2-preserving)]
We prove that the PFA lottery preparation of a strongly unfoldable cardinal
Changing the heights of automorphism towers by forcing with Souslin trees over 𝐿
[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.
The ground axiom is consistent with 𝑉 ≠ H O D
[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
The modal logic of forcing
[bibtex key=HamkinsLoewe2008:TheModalLogicOfForcing]
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
Follow-up article: Structural connections between a forcing class and its modal logic
Large cardinals with few measures
[bibtex key=ApterCummingsHamkins2006:LargeCardinalsWithFewMeasures]
We show, assuming the consistency of one measurable cardinal, that it is consistent for there to be exactly
Diamond (on the regulars) can fail at any strongly unfoldable cardinal
[bibtex key=DzamonjaHamkins2006:DiamondCanFail]
If
The necessary maximality principle for c.c.c. forcing is equiconsistent with a weakly compact cardinal
[bibtex key=HamkinsWoodin2005:NMPccc]
The Necessary Maximality Principle for c.c.c. forcing asserts that any statement about a real in a c.c.c. extension that could become true in a further c.c.c. extension and remain true in all subsequent c.c.c. extensions, is already true in the minimal extension containing the real. We show that this principle is equiconsistent with the existence of a weakly compact cardinal.
See related article on the Maximality Principle
The Ground Axiom
[bibtex key=Hamkins2005:TheGroundAxiom]
This is an extended abstract for a talk I gave at the 2005 Workshop in Set Theory at the Mathematisches Forschungsinstitut Oberwolfach.
Oberwolfach Research Report 55/2005 | Ground Axiom on Wikipedia
Extensions with the approximation and cover properties have no new large cardinals
[bibtex key=Hamkins2003:ExtensionsWithApproximationAndCoverProperties]
If an extension
Exactly controlling the non-supercompact strongly compact cardinals
[bibtex key=ApterHamkins2003:ExactlyControlling]
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 of measurable cardinals. These results improve and unify previous results of the first author.
A simple maximality principle
[bibtex key=Hamkins2003:MaximalityPrinciple]
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
How tall is the automorphism tower of a group?
[bibtex key=Hamkins2001:HowTall?]
The automorphism tower of a group is obtained by computing its automorphism group, the automorphism group of that group, and so on, iterating transfinitely by taking the natural direct limit at limit stages. The question, known as the automorphism tower problem, is whether the tower ever terminates, whether there is eventually a fixed point, a group that is isomorphic to its automorphism group by the natural map. Wielandt (1939) proved the classical result that the automorphism tower of any finite centerless group terminates in finitely many steps. This was generalized to successively larger collections of groups until Thomas (1985) proved that every centerless group has a terminating automorphism tower. Here, it is proved that every group has a terminating automorphism tower. After this, an overview is given of the author’s (1997) result with Thomas revealing the set-theoretic essence of the automorphism tower of a group: the very same group can have wildly different towers in different models of set theory.