Abstract :
Assuming the existence of ω compact cardinals in a model on GCH, we prove the consistency of some new canonization properties on View the MathML source. Our aim is to get as dense patterns in the distribution of indiscernibles as possible. We prove Theorem 2.1. thm2.1Suppose the consistency of “View the MathML sourcethere are infinitely many compact cardinals”. Then the following is consistent: View the MathML sourceand for every family (fn)0
Keywords :
Partitions , Forcing , Large cardinals
Journal title :
Annals of Pure and Applied Logic
Journal title :
Annals of Pure and Applied Logic