1Faculty of Mathematics Cardinal Stefan Wyszyński University Dewajtis 5, 01-815 Warszawa, Poland 2Faculty of Mathematics Cardinal Stefan Wyszyński University Dewajtis 5, 01-815 Warszawa, Poland and Institute of Mathematics Academy of Podlasie 08-110 Siedlce, Poland
Fundamenta Mathematicae, Tome 175 (2002) no. 2, pp. 119-125
We prove a version of the Ramsey theorem for partitions of (increasing) $n$-tuples. We derive this result from a version of König's infinity lemma for $\xi $-large trees. Here $\xi
\varepsilon _ 0$ and the notion of largeness is in the sense of Hardy hierarchy.
Keywords:
prove version ramsey theorem partitions increasing n tuples derive result version nigs infinity lemma large trees here varepsilon notion largeness sense hardy hierarchy
Affiliations des auteurs :
Teresa Bigorajska 
1
;
Henryk Kotlarski 
2
1
Faculty of Mathematics Cardinal Stefan Wyszyński University Dewajtis 5, 01-815 Warszawa, Poland
2
Faculty of Mathematics Cardinal Stefan Wyszyński University Dewajtis 5, 01-815 Warszawa, Poland and Institute of Mathematics Academy of Podlasie 08-110 Siedlce, Poland
@article{10_4064_fm175_2_2,
author = {Teresa Bigorajska and Henryk Kotlarski},
title = {Some combinatorics involving $\xi $-large sets},
journal = {Fundamenta Mathematicae},
pages = {119--125},
year = {2002},
volume = {175},
number = {2},
doi = {10.4064/fm175-2-2},
language = {en},
url = {http://geodesic.mathdoc.fr/articles/10.4064/fm175-2-2/}
}
TY - JOUR
AU - Teresa Bigorajska
AU - Henryk Kotlarski
TI - Some combinatorics involving $\xi $-large sets
JO - Fundamenta Mathematicae
PY - 2002
SP - 119
EP - 125
VL - 175
IS - 2
UR - http://geodesic.mathdoc.fr/articles/10.4064/fm175-2-2/
DO - 10.4064/fm175-2-2
LA - en
ID - 10_4064_fm175_2_2
ER -