Strong colorings over partitions

Bulletin of Symbolic Logic 27 (1):67-90 (2021)
  Copy   BIBTEX

Abstract

A strong coloring on a cardinal $\kappa $ is a function $f:[\kappa ]^2\to \kappa $ such that for every $A\subseteq \kappa $ of full size $\kappa $, every color $\unicode{x3b3} <\kappa $ is attained by $f\restriction [A]^2$. The symbol $$ \begin{align*} \kappa\nrightarrow[\kappa]^2_{\kappa} \end{align*} $$ asserts the existence of a strong coloring on $\kappa $.We introduce the symbol $$ \begin{align*} \kappa\nrightarrow_p[\kappa]^2_{\kappa} \end{align*} $$ which asserts the existence of a coloring $f:[\kappa ]^2\to \kappa $ which is strong over a partition $p:[\kappa ]^2\to \theta $. A coloring f is strong over p if for every $A\in [\kappa ]^{\kappa }$ there is $i<\theta $ so that for every color $\unicode{x3b3} <\kappa $ is attained by $f\restriction )$.We prove that whenever $\kappa \nrightarrow [\kappa ]^2_{\kappa }$ holds, also $\kappa \nrightarrow _p[\kappa ]^2_{\kappa }$ holds for an arbitrary finite partition p. Similarly, arbitrary finite p-s can be added to stronger symbols which hold in any model of ZFC. If $\kappa ^{\theta }=\kappa $, then $\kappa \nrightarrow _p[\kappa ]^2_{\kappa }$ and stronger symbols, like $\operatorname {Pr}_1_p$ or $\operatorname {Pr}_0_p$, also hold for an arbitrary partition p to $\theta $ parts.The symbols $$ \begin{gather*} \aleph_1\nrightarrow_p[\aleph_1]^2_{\aleph_1},\;\;\; \aleph_1\nrightarrow_p[\aleph_1\circledast \aleph_1]^2_{\aleph_1},\;\;\; \aleph_0\circledast\aleph_1\nrightarrow_p[1\circledast\aleph_1]^2_{\aleph_1}, \\ \operatorname{Pr}_1_p,\;\;\;\text{ and } \;\;\; \operatorname{Pr}_0_p \end{gather*} $$ hold for an arbitrary countable partition p under the Continuum Hypothesis and are independent over ZFC $+ \neg $ CH.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,423

External links

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

Through your library

Similar books and articles

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.
Analytic colorings.Wiesław Kubiś & Saharon Shelah - 2003 - Annals of Pure and Applied Logic 121 (2-3):145-161.
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.
Hierarchies of Δ 0 2 ‐measurable k‐partitions.Victor L. Selivanov - 2007 - Mathematical Logic Quarterly 53 (4-5):446-461.
A Graph-theoretic Method to Define any Boolean Operation on Partitions.David Ellerman - 2019 - The Art of Discrete and Applied Mathematics 2 (2):1-9.
Two Remarks on Partitions of ω with Finite Blocks.Stanislav Krajči - 1999 - Mathematical Logic Quarterly 45 (3):415-420.

Analytics

Added to PP
2021-02-23

Downloads
14 (#968,362)

6 months
4 (#800,606)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

On the ideal J[κ].Assaf Rinot - 2022 - Annals of Pure and Applied Logic 173 (2):103055.

Add more citations

References found in this work

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.
Getting more colors II.Todd Eisworth - 2013 - Journal of Symbolic Logic 78 (1):17-38.
Colouring and non-productivity of ℵ2-cc.Saharon Shelah - 1997 - Annals of Pure and Applied Logic 84 (2):153-174.
Colouring and non-productivity of ℵ2-C.C.Saharon Shelah - 1997 - Annals of Pure and Applied Logic 84 (2):153-174.

View all 11 references / Add more references