Abstract. The history of productivity of the -chain condition in partial orders, topological spaces, or Boolean algebras is surveyed, and its connection to the set-theoretic notion of a weakly compact cardinal is highlighted. Then, it is proved that for every regular cardinal , the principle is equivalent to the existence of a certain strong coloring for which the family of fibers is a nonspecial -Aronszajn tree.
The theorem follows from an analysis of a new characteristic function for walks on ordinals, and implies in particular that if the -chain condition is productive for a given regular cardinal , then is weakly compact in some inner model of ZFC. This provides a partial converse to the fact that if is a weakly compact cardinal, then the -chain condition is productive.
Downloads:
Citation information:
A. Rinot, Chain conditions of products, and weakly compact cardinals, Bull. Symbolic Logic, 20(3): 293-314, 2014.
Is it known if for inaccessible , implies the existence of a Souslin tree?
I was thinking maybe your new characterization of can be used to discuss this problem.
Pingback: The reflection principle | Assaf Rinot