A partition theorem for the infinite subtrees of a tree
HTML articles powered by AMS MathViewer
- by Keith R. Milliken PDF
- Trans. Amer. Math. Soc. 263 (1981), 137-148 Request permission
Abstract:
We prove a generalization for infinite trees of Silver’s partition theorem. This theorem implies a version for trees of the Nash-Williams partition theorem.References
- Erik Ellentuck, A new proof that analytic sets are Ramsey, J. Symbolic Logic 39 (1974), 163–165. MR 349393, DOI 10.2307/2272356
- P. Erdős and R. Rado, Combinatorial theorems on classifications of subsets of a given set, Proc. London Math. Soc. (3) 2 (1952), 417–439. MR 65615, DOI 10.1112/plms/s3-2.1.417
- Fred Galvin and Karel Prikry, Borel sets and Ramsey’s theorem, J. Symbolic Logic 38 (1973), 193–198. MR 337630, DOI 10.2307/2272055 C. Kuratowski, Topology, Vol. 1 (English rev. ed.), Academic Press, New York, 1966.
- Alain Louveau, Une démonstration topologique de théorèmes de Silver et Mathias, Bull. Sci. Math. (2) 98 (1974), no. 2, 97–102. MR 434824
- Keith R. Milliken, A Ramsey theorem for trees, J. Combin. Theory Ser. A 26 (1979), no. 3, 215–237. MR 535155, DOI 10.1016/0097-3165(79)90101-8 —, Some results in Ramsey theory, Doctoral Dissertation, U.C.L.A., 1975.
- C. St. J. A. Nash-Williams, On well-quasi-ordering transfinite sequences, Proc. Cambridge Philos. Soc. 61 (1965), 33–39. MR 173640, DOI 10.1017/s0305004100038603 F. P. Ramsey, On a problem of formal logic, Proc. London Math. Soc. (2) 30 (1929), 264-286.
- Jack Silver, Every analytic set is Ramsey, J. Symbolic Logic 35 (1970), 60–64. MR 332480, DOI 10.2307/2271156 A Taylor, Some results in partition theory, Doctoral Dissertation, Dartmouth College, 1975.
Additional Information
- © Copyright 1981 American Mathematical Society
- Journal: Trans. Amer. Math. Soc. 263 (1981), 137-148
- MSC: Primary 04A20; Secondary 05C05, 06A10
- DOI: https://doi.org/10.1090/S0002-9947-1981-0590416-8
- MathSciNet review: 590416