The definable tree property for successors of cardinals (Q506976): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(5 intermediate revisions by 4 users not shown) | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 03E35 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 03E05 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 03E55 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 03E50 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6680072 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
Aronszajn tree | |||
Property / zbMATH Keywords: Aronszajn tree / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
definable tree property | |||
Property / zbMATH Keywords: definable tree property / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
\(\varPi ^{1}_1\)-reflecting cardinal | |||
Property / zbMATH Keywords: \(\varPi ^{1}_1\)-reflecting cardinal / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
Easton reverse iteration | |||
Property / zbMATH Keywords: Easton reverse iteration / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
extender based Prikry forcing | |||
Property / zbMATH Keywords: extender based Prikry forcing / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2257297416 / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: 1511.04598 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Aronszajn trees on \(\aleph_2\) and \(\aleph_3\). / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Iterated Forcing and Elementary Embeddings / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The tree property / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Homogeneous iteration and measure one covering relative to HOD / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The consistency strength of successive cardinals with the tree property / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Multiple Forcing / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Set Theory / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the consistency of the Definable Tree Property on ℵ<sub>1</sub> / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The tree property at successors of singular cardinals / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Supercompact extender based Prikry forcing / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: ARONSZAJN TREES AND FAILURE OF THE SINGULAR CARDINAL HYPOTHESIS / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The tree property at ℵ<sub><i>ω</i>+1</sub> / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The self-iterability of <i>L</i>[<i>E</i>] / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 08:36, 13 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The definable tree property for successors of cardinals |
scientific article |
Statements
The definable tree property for successors of cardinals (English)
0 references
2 February 2017
0 references
Aronszajn tree
0 references
definable tree property
0 references
\(\varPi ^{1}_1\)-reflecting cardinal
0 references
Easton reverse iteration
0 references
extender based Prikry forcing
0 references