Tall cardinals

Posted on September 25, 2011 by Joel David Hamkins

[bibtex key=Hamkins2009:TallCardinals]

A cardinal $𝜅$ is tall if for every ordinal $𝜃$ there is an embedding $𝑗 : 𝑉 \to 𝑀$ with critical point $𝜅$ such that $𝑗 (𝜅) > 𝜃$ and $𝑀 𝜅 \subset 𝑀$ . 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 of forcing notions, including forcing that pumps up the value of $2 𝜅$ as high as desired.

The proper and semi-proper forcing axioms for forcing notions that preserve $ℵ 2$ or $ℵ 3$

Posted on September 25, 2011 by Joel David Hamkins

[bibtex key=HamkinsJohnstone2009:PFA(aleph_2-preserving)]

We prove that the PFA lottery preparation of a strongly unfoldable cardinal $𝜅$ under $\neg 0 ♯$ forces $P F A (ℵ 2 - p r e s e r v i n g)$ , $P F A (ℵ 3 - p r e s e r v i n g)$ and $P F A ℵ 2$ , with $2 𝜔 = 𝜅 = ℵ 2$ . The method adapts to semi-proper forcing, giving $S P F A (ℵ 2 - p r e s e r v i n g)$ , $S P F A (ℵ 3 - p r e s e r v i n g)$ and $S P F A ℵ 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 $S P F A (ℵ 2 - p r e s e r v i n g) + S P F A (ℵ 3 - p r e s e r v i n g) + S P F A ℵ 2 + 2 𝜔 = ℵ 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 $ℵ 3$ to $ℵ 1$ .

Infinite time computable model theory

Posted on September 25, 2011 by Joel David Hamkins

[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 $ℝ$ . 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.

Changing the heights of automorphism towers by forcing with Souslin trees over $𝐿$

Posted on September 25, 2011 by Joel David Hamkins

[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 $𝑉 \neq H O D$

Posted on September 25, 2011 by Joel David Hamkins

[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 $𝑉 = H O D$ . In this article, we show that the Ground Axiom is relatively consistent with $𝑉 \neq H O D$ . In fact, every model of ZFC has a class-forcing extension that is a model of $Z F C + G A + 𝑉 \neq H O D$ . The method accommodates large cardinals: every model of ZFC with a supercompact cardinal, for example, has a class-forcing extension with $Z F C + G A + 𝑉 \neq H O D$ in which this supercompact cardinal is preserved.

Large cardinals with few measures

Posted on September 25, 2011 by Joel David Hamkins

[bibtex key=ApterCummingsHamkins2006:LargeCardinalsWithFewMeasures]

We show, assuming the consistency of one measurable cardinal, that it is consistent for there to be exactly $𝜅 +$ many normal measures on the least measurable cardinal $𝜅$ . This answers a question of Stewart Baldwin. The methods generalize to higher cardinals, showing that the number of $𝜆$ -strong compactness or $𝜆$ -supercompactness measures on $𝑃 𝜅 (𝜆)$ can be exactly $𝜆 +$ , if $𝜆 > 𝜅$ is a regular cardinal. We conclude with a list of open questions. Our proofs use a critical observation due to James Cummings.

A survey of infinite time Turing machines

Posted on September 25, 2011 by Joel David Hamkins

[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.

The complexity of quickly decidable ORM-decidable sets

Posted on September 25, 2011 by Joel David Hamkins

[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 $𝜔 𝜔$ . Further, we show that the hyperarithmetical sets are exactly those sets that can be decided by an ORM in time uniformly less than $𝜔 𝐶 𝐾 1$ .

Post's Problem for Ordinal Register Machines

Posted on September 25, 2011 by Joel David Hamkins

[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.

The halting problem is decidable on a set of asymptotic probability one

Posted on September 25, 2011 by Joel David Hamkins

[bibtex key=HamkinsMiasnikov2006:HaltingProblemDecidable]

The halting problem for Turing machines is decidable on a set of asymptotic probability one. Specifically, there is a set B of Turing machine programs such that (i) B has asymptotic probability one, so that as the number of states n increases, the proportion of all n-state programs that are in B goes to one; (ii) B is polynomial time decidable; and (iii) the halting problem H intersect B is polynomial time decidable. The proof is sensitive to the particular computational model.

Diamond (on the regulars) can fail at any strongly unfoldable cardinal

Posted on September 25, 2011 by Joel David Hamkins

[bibtex key=DzamonjaHamkins2006:DiamondCanFail]

If $𝜅$ is any strongly unfoldable cardinal, then this is preserved in a forcing extension in which $◊ 𝜅 (R E G)$ fails. This result continues the progression of the corresponding results for weakly compact cardinals, due to Woodin, and for indescribable cardinals, due to Hauser.

$P \neq N P \cap c o - N P$ for infinite time Turing machines

Posted on September 25, 2011 by Joel David Hamkins

[bibtex key=DeolalikarHamkinsSchindler2005:NPcoNP]

Extending results of Schindler [math.LO/0106087] and also my paper with Philip Welch, we establish in the context of infinite time Turing machines that $𝑃$ is properly contained in $𝑁 𝑃$ intersect $𝑐 𝑜 𝑁 𝑃$ . Furthermore, $𝑁 𝑃 \cap 𝑐 𝑜 𝑁 𝑃$ is exactly the class of hyperarithmetic sets. For the more general classes, we establish that $𝑃 + = (𝑁 𝑃 + \cap 𝑐 𝑜 𝑁 𝑃 +) = (𝑁 𝑃 \cap 𝑐 𝑜 𝑁 𝑃)$ , though $𝑃 + +$ is properly contained in $𝑁 𝑃 + + \cap 𝑐 𝑜 𝑁 𝑃 + +$ . Within any contiguous block of infinite clockable ordinals, we show that $𝑃 𝛼$ is not equal to $𝑁 𝑃 𝛼 \cap 𝑐 𝑜 𝑁 𝑃 𝛼$ , but if $𝛽$ begins a gap in the clockable ordinals, then $𝑃 𝛽 = 𝑁 𝑃 𝛽 \cap 𝑐 𝑜 𝑁 𝑃 𝛽$ . Finally, we establish that $𝑃 𝑓$ is not equal to $𝑁 𝑃 𝑓 \cap 𝑐 𝑜 𝑁 𝑃 𝑓$ for most functions $𝑓$ from the reals to the ordinals, although we provide examples where $𝑃 𝑓 = 𝑁 𝑃 𝑓 \cap 𝑐 𝑜 𝑁 𝑃 𝑓$ and $𝑃 𝑓$ is not equal to $𝑁 𝑃 𝑓$ .

The necessary maximality principle for c.c.c. forcing is equiconsistent with a weakly compact cardinal

Posted on September 25, 2011 by Joel David Hamkins

[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.

The Ground Axiom

Posted on September 25, 2011 by Joel David Hamkins

[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

Share:

Share:

Share:

Share:

Share:

Share:

Share:

Share:

Share:

Share:

Share:

Share:

Share:

Share:

Share: