Partition Theorems from Creatures and Idempotent Ultrafilters

Andrzej Rosłanowski; Saharon Shelah

doi:10.1007/s00026-013-0184-7

Partition Theorems from Creatures and Idempotent Ultrafilters

Andrzej Rosłanowski^*
, Saharon Shelah

^*Corresponding author for this work

Einstein Institute of Mathematics

Research output: Contribution to journal › Article › peer-review

3 Scopus citations

Abstract

We show a general scheme of Ramsey-type results for partitions of countable sets of finite functions, where "one piece is big" is interpreted in the language originating in creature forcing. The heart of our proofs follows Glazer's proof of the Hindman Theorem, so we prove the existence of idempotent ultrafilters with respect to suitable operation. Then we deduce partition theorems related to creature forcings.

Original language	English
Pages (from-to)	353-378
Number of pages	26
Journal	Annals of Combinatorics
Volume	17
Issue number	2
DOIs	https://doi.org/10.1007/s00026-013-0184-7
State	Published - Jun 2013

Keywords

norms on possibilities
partition theorems
ultrafilters

Access to Document

10.1007/s00026-013-0184-7

Cite this

@article{865f384a30314345b5f62c4f58ce948f,

title = "Partition Theorems from Creatures and Idempotent Ultrafilters",

abstract = "We show a general scheme of Ramsey-type results for partitions of countable sets of finite functions, where {"}one piece is big{"} is interpreted in the language originating in creature forcing. The heart of our proofs follows Glazer's proof of the Hindman Theorem, so we prove the existence of idempotent ultrafilters with respect to suitable operation. Then we deduce partition theorems related to creature forcings.",

keywords = "norms on possibilities, partition theorems, ultrafilters",

author = "Andrzej Ros{\l}anowski and Saharon Shelah",

year = "2013",

month = jun,

doi = "10.1007/s00026-013-0184-7",

language = "אנגלית",

volume = "17",

pages = "353--378",

journal = "Annals of Combinatorics",

issn = "0218-0006",

publisher = "Birkhauser Verlag Basel",

number = "2",

}

TY - JOUR

T1 - Partition Theorems from Creatures and Idempotent Ultrafilters

AU - Rosłanowski, Andrzej

AU - Shelah, Saharon

PY - 2013/6

Y1 - 2013/6

N2 - We show a general scheme of Ramsey-type results for partitions of countable sets of finite functions, where "one piece is big" is interpreted in the language originating in creature forcing. The heart of our proofs follows Glazer's proof of the Hindman Theorem, so we prove the existence of idempotent ultrafilters with respect to suitable operation. Then we deduce partition theorems related to creature forcings.

AB - We show a general scheme of Ramsey-type results for partitions of countable sets of finite functions, where "one piece is big" is interpreted in the language originating in creature forcing. The heart of our proofs follows Glazer's proof of the Hindman Theorem, so we prove the existence of idempotent ultrafilters with respect to suitable operation. Then we deduce partition theorems related to creature forcings.

KW - norms on possibilities

KW - partition theorems

KW - ultrafilters

UR - https://www.scopus.com/pages/publications/84878208167

U2 - 10.1007/s00026-013-0184-7

DO - 10.1007/s00026-013-0184-7

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:84878208167

SN - 0218-0006

VL - 17

SP - 353

EP - 378

JO - Annals of Combinatorics

JF - Annals of Combinatorics

IS - 2

ER -

Partition Theorems from Creatures and Idempotent Ultrafilters

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this