Hostname: page-component-76fb5796d-vfjqv Total loading time: 0 Render date: 2024-04-26T10:38:17.763Z Has data issue: false hasContentIssue false

Getting more colors II

Published online by Cambridge University Press:  12 March 2014

Todd Eisworth*
Affiliation:
Department of Mathematics, Ohio University, Athens, OH 45701, USA, E-mail: eisworth@math.ohiou.edu

Abstract

We formulate and prove (in ZFC) a strong coloring theorem which holds at successors of singular cardinals, and use it to answer several questions concerning Shelah's principle Pr1 (μ+, μ+, μ+, cf (μ)) for singular μ.

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 2013

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

[1]Cummings, James, Notes on singular cardinal combinatorics, Notre Dame Journal of Formal Logic, vol. 46 (2005), no. 3, pp. 251282.CrossRefGoogle Scholar
[2]Eisworth, Todd, A note on strong negative partition relations, Fundamenta Mathematicae, vol. 202 (2009), pp. 97123.CrossRefGoogle Scholar
[3]Eisworth, Todd, Club-guessing, stationary reflection, and coloring theorems, Annals of Pure and Applied Logic, vol. 161 (2010), no. 10, pp. 12161243.CrossRefGoogle Scholar
[4]Eisworth, Todd, Simultaneous reflection and impossible ideals, preprint, 12 2010.Google Scholar
[5]Eisworth, Todd, Successors of singular cardinals, Handbook of set theory (Foreman, M. and Kanamori, A., editors), vol. 2, Springer, 2010, pp. 12291350.CrossRefGoogle Scholar
[6]Eisworth, Todd, Getting more colors I, this Journal, vol. 78 (2012), no. 1, pp. 116.Google Scholar
[7]Eisworth, Todd and Shelah, Saharon, Successors of singular cardinals and coloring theorems I, Archive for Mathematical Logic, vol. 44 (2005), pp. 597618.CrossRefGoogle Scholar
[8]Eisworth, Todd and Shelah, Saharon, Successors of singular cardinals and coloring theorems II, this Journal, vol. 74 (2009), no. 4, pp. 12871309.Google Scholar
[9]Erdős, Paul, Hajnal, András, Attila Máté, , and Rado, Richard, Combinatorial set theory: partition relations for cardinals, Studies in Logic and the Foundations of Mathematics, vol. 106, North-Holland, Amsterdam, 1984.Google Scholar
[10]Rinot, Assaf, Transforming rectangles into squares, with applications to strong colorings, preprint of 03 2011.Google Scholar
[11]Shelah, Saharon, Cardinal arithmetic, Oxford Logic Guides, vol. 29, Oxford University Press, 1994.CrossRefGoogle Scholar
[12]Shelah, Saharon, Colouring and non-productivity of ℵ2-c.c., Annals of Pure and Applied Logic, vol. 84 (1997), no. 2, pp. 153174.CrossRefGoogle Scholar
[13]Todorčević, Stevo, Partitioning pairs of countable ordinals, Acta Mathematica, vol. 159 (1987), no. 3–4, pp. 261294.CrossRefGoogle Scholar
[14]Todorčević, Stevo, Walks on ordinals and their characteristics, Progress in Mathematics, vol. 263, Birkhäuser Verlag, Basel, 2007.CrossRefGoogle Scholar