A hierarchy of Ramsey-like cardinals

被引：7

作者：

Holy, Peter ^{[1
]}

Schlicht, Philipp ^{[1
]}

机构：

[1] Univ Bonn, Math Inst, Endenicher Allee 60, D-53115 Bonn, Germany

来源：

FUNDAMENTA MATHEMATICAE | 2018年 / 242卷 / 01期

关键词：

large cardinals; Ramsey cardinals; filters; infinite games;

D O I：

10.4064/fm396-9-2017

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

We introduce a hierarchy of large cardinals between weakly compact and measurable cardinals, that is closely related to the Ramsey-like cardinals introduced by Victoria Gitman (2011), and is based on certain infinite filter games, but also has a range of equivalent characterizations in terms of elementary embeddings. The aim of this paper is to locate the Ramsey-like cardinals studied by Gitman, and other well-known large cardinal notions, in this hierarchy.

引用

页码：49 / 74

页数：26

共 50 条

[21] FINE HIERARCHY OF PARTITION CARDINALS
DRAKE, FR
JOURNAL OF SYMBOLIC LOGIC, 1974, 39 (01) : 195 - 195
[22] On unfoldable cardinals, ω-closed cardinals, and the beginning of the inner model hierarchy
Welch, PD
ARCHIVE FOR MATHEMATICAL LOGIC, 2004, 43 (04) : 443 - 458
[23] On unfoldable cardinals, ω-closed cardinals, and the beginning of the inner model hierarchy
P. D. Welch
Archive for Mathematical Logic, 2004, 43 : 443 - 458
[24] A HIERARCHY OF FILTERS ON REGULAR UNCOUNTABLE CARDINALS
JECH, T
JOURNAL OF SYMBOLIC LOGIC, 1987, 52 (02) : 388 - 395
[25] GAMMA-RAMSEY AND GAMMA-INEFFABLE CARDINALS
HENLE, JM
ISRAEL JOURNAL OF MATHEMATICS, 1978, 30 (1-2) : 85 - 98
[26] No Decreasing Sequence of Cardinals in the Hierarchy of Choice Principles
Tachtsis, Eleftherios
NOTRE DAME JOURNAL OF FORMAL LOGIC, 2024, 65 (03) : 311 - 331
[27] ORDINAL NOTATIONS BASED ON A HIERARCHY OF INACCESSIBLE CARDINALS
POHLERS, W
ANNALS OF PURE AND APPLIED LOGIC, 1987, 33 (02) : 157 - 179
[28] Greatly Erdos cardinals with some generalizations to the Chang and Ramsey properties
Sharpe, I.
Welch, P. D.
ANNALS OF PURE AND APPLIED LOGIC, 2011, 162 (11) : 863 - 902
[29] Graph Ramsey theory and the polynomial hierarchy
Schaefer, M
FOURTEENTH ANNUAL IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY, PROCEEDINGS, 1999, : 6 - 6
[30] A REFINEMENT OF THE RAMSEY HIERARCHY VIA INDESCRIBABILITY
Cody, Brent
JOURNAL OF SYMBOLIC LOGIC, 2020, 85 (02) : 773 - 808

← 1 2 3 4 5 →