Complicated colorings, revisited

&
Annals of Pure and Applied Logic 174 (4):103243 (2023)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.apal.2022.103243

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,682

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Knaster and Friends III: Subadditive Colorings.Chris Lambie-Hanson & Assaf Rinot - 2023 - Journal of Symbolic Logic 88 (3):1230-1280.
Analytic colorings.Wiesław Kubiś & Saharon Shelah - 2003 - Annals of Pure and Applied Logic 121 (2-3):145-161.
Two cardinal models for singular µ.Shimon Garti & Saharon Shelah - 2007 - Mathematical Logic Quarterly 53 (6):636-641.
Successors of singular cardinals and coloring theorems I.Todd Eisworth & Saharon Shelah - 2005 - Archive for Mathematical Logic 44 (5):597-618.
Weak diamond and open colorings.Justin Tatch Moore - 2003 - Journal of Mathematical Logic 3 (01):119-125.
Feasible Graphs and Colorings.Douglas Cenzer & Jeffrey Remmel - 1995 - Mathematical Logic Quarterly 41 (3):327-352.
Cohesive sets and rainbows.Wei Wang - 2014 - Annals of Pure and Applied Logic 165 (2):389-408.
Stable Ramsey's Theorem and Measure.Damir D. Dzhafarov - 2011 - Notre Dame Journal of Formal Logic 52 (1):95-112.
A dual open coloring axiom.Stefan Geschke - 2006 - Annals of Pure and Applied Logic 140 (1):40-51.
A note on edge colorings and trees.Adi Jarden & Ziv Shami - 2022 - Mathematical Logic Quarterly 68 (4):447-457.
Acceptable colorings of indexed hyperspaces.James H. Schmerl - 2018 - Journal of Symbolic Logic 83 (4):1644-1666.
On the consistency of some partition theorems for continuous colorings. [REVIEW]J. Stepr\={A.}ns - 2002 - Bulletin of Symbolic Logic 8 (2):303-305.
Graph colorings and recursively bounded< i> Π_< sub> 1< sup> 0-classes.J. B. Remmel - 1986 - Annals of Pure and Applied Logic 32 (C):185-194.
Graph colorings and recursively bounded Π10-classes.J. B. Remmel - 1986 - Annals of Pure and Applied Logic 32:185-194.
Effective coloration.Dwight R. Bean - 1976 - Journal of Symbolic Logic 41 (2):469-480.

Analytics

Added to PP
2023-01-25

Downloads
15 (#966,573)

6 months
8 (#405,070)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

No citations found.

Add more citations

References found in this work

Simultaneous stationary reflection and square sequences.Yair Hayut & Chris Lambie-Hanson - 2017 - Journal of Mathematical Logic 17 (2):1750010.
Chain conditions of products, and weakly compact cardinals.Assaf Rinot - 2014 - Bulletin of Symbolic Logic 20 (3):293-314,.
Knaster and friends II: The C-sequence number.Chris Lambie-Hanson & Assaf Rinot - 2020 - Journal of Mathematical Logic 21 (1):2150002.
Club-guessing, stationary reflection, and coloring theorems.Todd Eisworth - 2010 - Annals of Pure and Applied Logic 161 (10):1216-1243.
Knaster and Friends III: Subadditive Colorings.Chris Lambie-Hanson & Assaf Rinot - 2023 - Journal of Symbolic Logic 88 (3):1230-1280.

View all 12 references / Add more references