Cross-constraint basis theorems and products of partitions
Logic
2024-07-03 v1
Abstract
We both survey and extend a new technique from Lu Liu to prove separation theorems between products of Ramsey-type theorems over computable reducibility. We use this technique to show that Ramsey's theorem for -tuples and three colors is not computably reducible to finite products of Ramsey's theorem for -tuples and two colors.
Keywords
Cite
@article{arxiv.2407.02206,
title = {Cross-constraint basis theorems and products of partitions},
author = {Julien Cervelle and William Gaudelier and Ludovic Levy Patey},
journal= {arXiv preprint arXiv:2407.02206},
year = {2024}
}
Comments
35 pages