A REFINEMENT OF THE RAMSEY HIERARCHY VIA INDESCRIBABILITY

DOI10.1017/jsl.2019.94zbMath1485.03219arXiv1907.13540OpenAlexW3099210599MaRDI QIDQ5148109

Brent M. Cody

Publication date: 29 January 2021

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1907.13540

zbMATH Keywords

Ramseyindescribablelarge cardinal idealsgeneric embedding

Mathematics Subject Classification ID

Large cardinals (03E55) Other combinatorial set theory (03E05) Partition relations (03E02)

Related Items (3)

Ramsey-like operators ⋮ IDEAL OPERATORS AND HIGHER INDESCRIBABILITY ⋮ Higher indescribability and derived topologies

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The combinatorial essence of supercompactness
• Greatly Erdős cardinals with some generalizations to the Chang and Ramsey properties
• Small embedding characterizations for large cardinals
• Small models, large cardinals, and induced ideals
• Easton's theorem for Ramsey and strongly Ramsey cardinals
• A hierarchy of Ramsey cardinals
• On families of mutually exclusive sets
• Ramsey-like cardinals
• Ramsey-like cardinals II
• Ideals and Generic Elementary Embeddings
• A partition calculus in set theory
• On the structure of set-mappings
• Ramsey cardinals and constructibility
• A hierarchy of Ramsey-like cardinals
• GAMES AND RAMSEY-LIKE CARDINALS
• Derived topologies on ordinals and stationary reflection
• Set Theory
• A Mitchell-like order for Ramsey and Ramsey-like cardinals
• Combinatorial Theorems on Classifications of Subsets of a Given Set

This page was built for publication: A REFINEMENT OF THE RAMSEY HIERARCHY VIA INDESCRIBABILITY