A canonical Ramsey-type theorem for finite subsets of N

Abstrakt

We show that whenever we color the finite subsets of N with arbitrarily many colors, we find a canonically colored arithmetic copy of an omega-forest. The five types of the canonical coloring are determined.