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

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Jindřich Zapletal / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Igor Vladimirov Protasov / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2172295723 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: math/0212042 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitions of products / rank
 
Normal rank
Property / cites work
 
Property / cites work: Borel partitions of products of finite sets and the Ackermann function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized partitions of products of finite sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large correlated families of positive random variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Borel sets and Ramsey's theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3852172 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3529420 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Products of Infinitely Many Perfect Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: <i>n</i>–localization property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Norms on possibilities. I. Forcing with trees and creatures / rank
 
Normal rank

Latest revision as of 19:12, 4 July 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
    0 references
    0 references
    0 references
    0 references
    Ramsey theorems
    0 references
    creature forcing
    0 references
    polarized partition
    0 references
    0 references
    0 references