The covering lemma up to a Woodin cardinal (Q678765): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(6 intermediate revisions by 5 users not shown) | |||
Property / author | |||
Property / author: William J. Mitchell / rank | |||
Property / author | |||
Property / author: Ernest Schimmerling / rank | |||
Property / author | |||
Property / author: William J. Mitchell / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Ernest Schimmerling / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q124964864 / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: math/9702207 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3329455 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Core models / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The core model / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The covering lemma for K / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The covering lemma for L[U] / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The fine structure of the constructible hierarchy / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Iteration Trees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The core model for sequences of measures. I / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Weak covering without countable closure / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4291791 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Combinatorial principles in the core model for one Woodin cardinal / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The maximality of the core model / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Fine structure for tame inner models / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The well-foundedness of the Mitchell order / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Inner models with many Woodin cardinals / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Core models with more Woodin cardinals / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5690487 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Revision as of 12:19, 27 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The covering lemma up to a Woodin cardinal |
scientific article |
Statements
The covering lemma up to a Woodin cardinal (English)
0 references
8 July 1997
0 references
\(K\) is the core model for one Woodin cardinal as introduced by \textit{J.R. Steel} [The core model iterability problem (Lecture Notes Logic 8) (1996; Zbl 0864.03035)]. The authors prove the following covering lemma. \(\Omega\) is a measurable cardinal and there is no inner model with a Woodin cardinal. \(K\) is the core model constructed in \(V_\Omega\). \(\kappa<\Omega\) is a \(K\)-cardinal such that card(\(\kappa\)) is countably closed, i.e., for all \(\gamma<\text{card}(\kappa)\), \(\gamma^{\aleph_0}<\text{card}(\kappa)\). Let \(\lambda=(\kappa^+)^K\). Then \(\lambda<\kappa^+\) implies cf\((\lambda)=\text{card}(\kappa)\). Thus in \(K\) successors of countably closed, singular cardinals are computed correctly. As part of the proof the authors investigate the fine structure of \(K\).
0 references
covering lemma
0 references
Woodin cardinal
0 references
core model
0 references
successors of singular cardinals
0 references
fine structure
0 references