Bootstrapping the Primitive Recursive Functions by 47 Colors
Søren Riis
August 1994
Abstract:
I construct a concrete coloring of the 3 element subsets of
. It has the property that each homogeneous set
has its elements spread so much
apart that for . It uses only
47 colors. This is more economical than the approximately 160000 colors
used by Ketonen and Solovay.