Notre Dame Journal of Formal Logic

A Partition Theorem of ωωα

Claribet Piña

Full-text: Access denied (no subscription detected)

We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber. If you have a personal subscription to this journal, then please login. If you are already logged in, then you may need to update your profile to register your subscription. Read more about accessing full-text


We consider finite partitions of the closure F¯ of an ωα-uniform barrier F. For each partition, we get a homogeneous set having both the same combinatorial and topological structure as F¯, seen as a subspace of the Cantor space 2N.

Article information

Notre Dame J. Formal Logic, Volume 59, Number 3 (2018), 387-403.

Received: 2 April 2015
Accepted: 4 March 2016
First available in Project Euclid: 26 June 2018

Permanent link to this document

Digital Object Identifier

Mathematical Reviews number (MathSciNet)

Zentralblatt MATH identifier

Primary: 03E02: Partition relations
Secondary: 05D10: Ramsey theory [See also 05C55]

partition of topological spaces uniform barriers U-trees


Piña, Claribet. A Partition Theorem of $\omega^{\omega^{\alpha}}$. Notre Dame J. Formal Logic 59 (2018), no. 3, 387--403. doi:10.1215/00294527-2018-0001.

Export citation


  • [1] Argyros, S. A., and S. Todorcevic, Ramsey Methods in Analysis, Birkhäuser, Basel, 2005.
  • [2] Baumgartner, J. E., “Partition relations for countable topological spaces,” Journal of Combinatorial Theory, Series A, vol. 43 (1986), pp. 178–95.
  • [3] Piña, C., and C. Uzcátegui, “On topological properties of families of finite sets,” Journal of Combinatorial Theory, Series A, vol. 119 (2012), pp. 1066–77.
  • [4] Todorcevic, S., Introduction to Ramsey Spaces, vol. 174 of Annals of Mathematics Studies, Princeton University Press, Princeton, 2010.
  • [5] Weiss, W., “Partitioning topological spaces,” pp. 154–71 in Mathematics of Ramsey Theory, edited by J. Nešetřil and V. Rödl, vol. 5 of Algorithms and Combinatorics, Springer, Berlin, 1990.