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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / review text
 
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.
Property / review text: 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. / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Klaas Pieter Hart / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 03E05 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 03E02 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05D10 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 54D80 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6201586 / rank
 
Normal rank
Property / zbMATH Keywords
 
partition theorem
Property / zbMATH Keywords: partition theorem / rank
 
Normal rank
Property / zbMATH Keywords
 
norms on possibilities
Property / zbMATH Keywords: norms on possibilities / rank
 
Normal rank
Property / zbMATH Keywords
 
idempotent ultrafilters
Property / zbMATH Keywords: idempotent ultrafilters / rank
 
Normal rank

Revision as of 11:27, 28 June 2023

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