Partitioning $\alpha$-large sets for $\alpha<\varepsilon_{\omega}$
Combinatorics
2010-01-15 v1
Abstract
We generalise the results by Bigorajska and Kotlarski about partitioning -large sets, by extending the domain up to ordinals below . These results will be very useful to give a miniaturisation of the infinite Ramsey Theorem.
Cite
@article{arxiv.1001.2437,
title = {Partitioning $\alpha$-large sets for $\alpha<\varepsilon_{\omega}$},
author = {Michiel De Smet and Andreas Weiermann},
journal= {arXiv preprint arXiv:1001.2437},
year = {2010}
}
Comments
22 pages