Partition theorems from creatures and idempotent ultrafilters (Q360354): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4844091 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dual form of Ramsey's theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ultrafilters: Some old and some new results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ramsey ultrafilters and the reaping number - Con(\({\mathfrak r}<{\mathfrak u}\)) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regularity and Positional Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Partition Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decisive creatures and large continuum / rank
 
Normal rank
Property / cites work
 
Property / cites work: Creature forcing and large continuum: the joy of halving / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitions of Products / rank
 
Normal rank
Property / cites work
 
Property / cites work: Norms on possibilities. I. Forcing with trees and creatures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Measured creatures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonproper products / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ramsey theorems for product of finite sets with submeasures / rank
 
Normal rank

Latest revision as of 19:44, 6 July 2024

scientific article
Language Label Description Also known as
English
Partition theorems from creatures and idempotent ultrafilters
scientific article

    Statements

    Partition theorems from creatures and idempotent ultrafilters (English)
    0 references
    0 references
    0 references
    26 August 2013
    0 references
    In previous papers, e.g., [Mem. Am. Math. Soc. 671, 167 p. (1999; Zbl 0940.03059)], the authors have developed a very general and flexible framework for the construction of proper forcings that add reals of one kind without adding reals of other kinds. In this paper, the authors isolate a combinatorial common denominator of the properness arguments. The main idea is to create the desired generic condition from homogeneous sets for partitions and these homogeneous sets are in turn obtained using idempotent ultrafilters with respect to various operations on the Čech-Stone remainder of~\(\omega\). Unfortunately, the machinery takes a lot of definitions to set up, too many to summarize adequately.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    partition theorem
    0 references
    norms on possibilities
    0 references
    idempotent ultrafilters
    0 references
    0 references
    0 references