Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2407.02206 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910510140620800 |
|---|---|
| author | Cervelle, Julien Gaudelier, William Patey, Ludovic Levy |
| author_facet | Cervelle, Julien Gaudelier, William Patey, Ludovic Levy |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2407_02206 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Cross-constraint basis theorems and products of partitions Cervelle, Julien Gaudelier, William Patey, Ludovic Levy Logic 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. |
| title | Cross-constraint basis theorems and products of partitions |
| topic | Logic |
| url | https://arxiv.org/abs/2407.02206 |