Ramsey theorems for product of finite sets with submeasures (Q653997): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / OpenAlex ID
 
Property / OpenAlex ID: W2172295723 / rank
 
Normal rank

Revision as of 19:35, 19 March 2024

scientific article
Language Label Description Also known as
English
Ramsey theorems for product of finite sets with submeasures
scientific article

    Statements

    Ramsey theorems for product of finite sets with submeasures (English)
    0 references
    0 references
    0 references
    20 December 2011
    0 references
    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\).
    0 references
    Ramsey theorems
    0 references
    creature forcing
    0 references
    polarized partition
    0 references

    Identifiers