Special Session
Recursive coloring without Δ30 witness for Hindman theorem
On-site
We give an example of a recursive coloring of integers which has no Δ30 witness for Hindman theorem and an example of a recursive coloring of integers such that any Π30 set of integers whose any two elements are apartness is not a witness for Hindman theorem.
References
- [1]
- Andreas R. Blass,Jeffry L. Hirst,Stephen G. Simpson, LOGICAL ANALYSIS OF SOME THEOREMS OF COMBINATORICS AND TOPOLOGICAL DYNAMI, Contemporary Mathematics, vol. 65 (1987), pp. 125–156.
This document was translated from LATEX by HEVEA.