A parametrization of the abstract Ramsey theorem

Details A parametrization of the abstract Ramsey theorem A parametrization of the abstract Ramsey theorem

2010-11-18

arxiv.org/abs/1011.4263v1

Mathematics

Combinatorics

14 pages

Scientific paper

We give a parametrization with perfect subsets of $2^{\infty}$ of the abstract Ramsey theorem (see \cite{todo}) Our main tool is an extension of the parametrized version of the combinatorial forcing developed in \cite{nash} and \cite{todo}, used in \cite{mij} to the obtain a parametrization of the abstract Ellentuck theorem. As one of the consequences, we obtain a parametrized version of the Hales-Jewett theorem. Finally, we conclude that the family of perfectly ${\cal S}$-Ramsey subsets of $2^{\infty}\times {\cal R}$ is closed under the Souslin operation. {\bf Key words and phrases}: Ramsey theorem, Ramsey space, parametrization.

Affiliated with

Also associated with

No associations

Rating

A parametrization of the abstract Ramsey theorem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A parametrization of the abstract Ramsey theorem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A parametrization of the abstract Ramsey theorem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-537201