THE DEFINABILITY STRENGTH OF COMBINATORIAL PRINCIPLES
THE DEFINABILITY STRENGTH OF COMBINATORIAL PRINCIPLES
Abstract We introduce the definability strength of combinatorial principles. In terms of definability strength, a combinatorial principle is strong if solving a corresponding combinatorial problem could help in simplifying the definition of a definable set. We prove that some consequences of Ramseyā€™s Theorem for colorings of pairs could help in ā€¦