Cross-constraint basis theorems and products of partitions

2024/07/02 by Julien Cervelle, William Gaudelier, Cervelle, Julien +3
Computer Science · Mathematics · #Constraint Satisfaction and Optimization #Digital Image Processing Techniques #FOS: Mathematics #Logic (math.LO) #Mathematics and Applications

paper · pdf · doi:10.48550/arxiv.2407.02206

openalex publication_date 2024/07/02 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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 n-tuples and three colors is not computably reducible to finite products of Ramsey's theorem for n-tuples and two colors.

Related

• Coding power of product of partitions
• The reverse mathematics of Ramsey-type theorems
• The weakness of being cohesive, thin or free in reverse mathematics
• Ramsey theory over partitions I: Positive Ramsey relations from forcing axioms
• A packed Ramsey's theorem and computability theory