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!
|
Table of 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.