Access the full text.
Sign up today, get DeepDyve free for 14 days.
K. Milliken (1981)
A partition theorem for the infinite subtrees of a treeTransactions of the American Mathematical Society, 263
S. Todorcevic (2010)
Introduction to Ramsey Spaces
F Galvin (1968)
Partition theorems for the real lineNotices Am. Math. Soc., 15
J. Nesetril, V. Rödl (1977)
A structural generalization of the Ramsey theoremBulletin of the American Mathematical Society, 83
J. Halpern, H. Läuchli (1966)
A partition theoremTransactions of the American Mathematical Society, 124
A. Blass (1981)
A partition theorem for perfect sets, 82
J. Silver (1970)
Every analytic set is RamseyJournal of Symbolic Logic, 35
Stefan Geschke (2012)
Clopen Graphs
An induced Ramsey theorem for modular profinite graphs
We construct a collection of new topological Ramsey spaces of trees. It is based on the Halpern-Läuchli theorem, but different from the Milliken space of strong subtrees. We give an example of its application by proving a partition theorem for profinite graphs.
Archive for Mathematical Logic – Springer Journals
Published: Feb 10, 2018
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.