Ramsey theorems for product of finite sets with submeasures (Q653997)

The authors test the creature forcing from \textit{A. Rosłanowski} and \textit{S. Shelah} [Mem. Am. Math. Soc. 671 (1999; Zbl 0940.03059)] on the Ramsey proving ground. As a basic statement they prove: Suppose \(k\in\omega\) is a number and \(r_n: n\in \omega\) is a sequence of real numbers. Then for every sequence of submeasures \(\phi_n:n\in\omega\) on finite sets, increasing fast enough, and for every partition \(B_i: i\in k\) of the product \(\Pi_n\; dom(\phi_n)\times \omega\) into Borel sets, one of the pieces contains a product of the form \(\Pi_n b_n\times c\) where \(c\subset \omega\) is an infinite set, and \(b_n \subset dom(\phi_n)\) and \(\phi_n(b_n) > r_n\) for every number \(n\in\omega\).