Ramsey's Theorem with Sums or Unions

Abstract Using Hindman's theorem as a strong pigeonhole principle, we prove strengthened versions of Ramsey's theorem and of various generalizations of Ramsey's theorem due to Nash-Williams, Galvin and Prikry, and Silver.

[1]  Neil Hindman,et al.  Finite Sums from Sequences Within Cells of a Partition of N , 1974, J. Comb. Theory, Ser. A.

[2]  C. St. J. A. Nash-Williams,et al.  On well-quasi-ordering transfinite sequences , 1965, Mathematical Proceedings of the Cambridge Philosophical Society.

[3]  Jack Howard Silver,et al.  Every analytic set is Ramsey , 1970, Journal of Symbolic Logic.

[4]  James E. Baumgartner,et al.  A Short Proof of Hindman's Theorem , 1974, J. Comb. Theory, Ser. A.

[5]  Neil Hindman.  The existence of certain ultra-filters on and a conjecture of Graham and Rothschild , 1972 .

[6]  Fred Galvin,et al.  Borel sets and Ramsey's theorem , 1973, Journal of Symbolic Logic.

[7]  J. G. Thompson,et al.  A Generalization of a Theorem of , 1973 .

[8]  R. Graham,et al.  Ramsey’s theorem for $n$-parameter sets , 1971 .

[9]  Erik Ellentuck,et al.  A new proof that analytic sets are Ramsey , 1974, Journal of Symbolic Logic.

[10]  Frank Plumpton Ramsey,et al.  On a Problem of Formal Logic , 1930 .