- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
A Partition Theorem of $omega^{omega^{alpha}}$
Notre Dame Journal of Formal Logic 59 (3):387-403 (2018)
Abstract
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.Links
PhilArchive
External links
(no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Sign in / register and customize your OpenURL resolver
- Configure custom resolver
My notes
Similar books and articles
A partition relation for pairs on $$omega ^{omega ^omega }$$.Claribet Piña - 2018 - Archive for Mathematical Logic 57 (7-8):727-753.
A recursion theoretic analysis of the clopen Ramsey theorem.Peter Clote - 1984 - Journal of Symbolic Logic 49 (2):376-400.
Effective Versions of Ramsey's Theorem: Avoiding the Cone Above $\mathbf{0}$'.Tamara Lakins Hummel - 1994 - Journal of Symbolic Logic 59 (4):1301-1325.
On the Indecomposability of $\omega^{n}$.Jared R. Corduan & François G. Dorais - 2012 - Notre Dame Journal of Formal Logic 53 (3):373-395.
A collection of topological Ramsey spaces of trees and their application to profinite graph theory.Yuan Yuan Zheng - 2018 - Archive for Mathematical Logic 57 (7-8):939-952.
Weak partition properties on trees.Michael Hrušák, Petr Simon & Ondřej Zindulka - 2013 - Archive for Mathematical Logic 52 (5-6):543-567.
On the Strength of Ramsey's Theorem.David Seetapun & Theodore A. Slaman - 1995 - Notre Dame Journal of Formal Logic 36 (4):570-582.
Two topological equivalents of the axiom of choice.Eric Schechter & E. Schechter - 1992 - Mathematical Logic Quarterly 38 (1):555-557.
The dual Cantor-Bernstein theorem and the partition principle.Bernhard Banaschewski & Gregory H. Moore - 1990 - Notre Dame Journal of Formal Logic 31 (3):375-381.
Scattered and hereditarily irresolvable spaces in modal logic.Guram Bezhanishvili & Patrick J. Morandi - 2010 - Archive for Mathematical Logic 49 (3):343-365.
Analytics
Added to PP
2018-06-26
Downloads
10 (#1,207,573)
6 months
2 (#1,448,208)
2018-06-26
Downloads
10 (#1,207,573)
6 months
2 (#1,448,208)
Historical graph of downloads
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-6686886f5-ktvwr uwo