Lower bounds on coloring numbers from hardness hypotheses in pcf theory

DOI10.1090/proc/13163OpenAlexW2963963422WikidataQ114094235 ScholiaQ114094235MaRDI QIDQ2827384

Saharon Shelah

Publication date: 19 October 2016

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Other combinatorial set theory (03E05) Ordered sets and their cofinalities; pcf theory (03E04) Model theory of denumerable and separable structures (03C15)

Related Items (1)

On the arithmetic of density

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The list-chromatic number of infinite graphs
• Applications of pcf for mild large cardinals to elementary embeddings
• Shelah's revised GCH theorem and a question by Alon on infinite graphs colorings
• A compactness theorem for singular cardinals, free algebras, Whitehead problem and transversals
• Random graphs in the monadic theory of order
• More on cardinal arithmetic
• The generalized continuum hypothesis revisited
• Pcf and abelian groups
• Was Sierpiński right? IV
• Advances in Cardinal Arithmetic
• On chromatic number of graphs and set-systems
• Two cardinals models with gap one revisited

This page was built for publication: Lower bounds on coloring numbers from hardness hypotheses in pcf theory