Indescribable cardinals without diamonds (Q1813062): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Higher Souslin trees and the generalized continuum hypothesis / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Indescribable cardinals and elementary embeddings / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The indescribability of the order of the indescribable cardinals / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Revision as of 16:56, 14 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Indescribable cardinals without diamonds |
scientific article |
Statements
Indescribable cardinals without diamonds (English)
0 references
25 June 1992
0 references
Recall the combinatorial principle \(\diamondsuit_{\kappa,E}\): There is a sequence \(\langle S_ \alpha: \alpha\in E\rangle\) such that \(\forall\alpha\in E\), \(S_ \alpha\subseteq\alpha\), and \(\forall S\subseteq\kappa\), \(\{\alpha\in E:S_ \alpha=S\cap\alpha\}\) is stationary in \(\kappa\), where \(E\) is a stationary subset of some regular cardinal \(\kappa\). Large cardinals carry \(\diamondsuit\) sequences, for example R. Jensen has shown that \(ZFC\vdash\forall\kappa(\kappa\hbox{ subtle}\to\diamondsuit_{\kappa,Reg\cap\kappa})\) , where \(Reg\) is the class of all regular cardinals. Assuming the consistency of the existence of a \(\Pi^ m_ n\) \((m\geq 1\), \(n\geq 1)\) indescribable cardinal, we construct a model in which \(\diamondsuit_{\kappa,Reg\cap\kappa}\) fails at some indescribable cardinal \(\kappa\). Moreover, the model satisfies the Generalized Continuum Hypothesis. The construction uses iterated forcing and master condition arguments together with an elementary embedding characterization of \(\Pi^ m_ n\) indescribability.
0 references
combinatorial principle
0 references
indescribable cardinal
0 references
Generalized Continuum Hypothesis
0 references
iterated forcing
0 references
elementary embedding
0 references