More on the indivisibility of $\mathbb{Q}$
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866929409231945728 |
|---|---|
| author | Pauly, Arno |
| author_facet | Pauly, Arno |
| contents | We study the complexity of the computational task ``Given a colouring $c : \mathbb{Q} \to \mathbf{k}$, find a monochromatic $S \subseteq \mathbb{Q}$ such that $(S,<) \cong (\mathbb{Q},<)$''. The framework is Weihrauch reducibility. Our results answer some open questions recently raised by Gill, and by Dzhafarov, Solomon and Valenti. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2407_03722 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | More on the indivisibility of $\mathbb{Q}$ Pauly, Arno Logic Logic in Computer Science Combinatorics 03D30, 05C55 We study the complexity of the computational task ``Given a colouring $c : \mathbb{Q} \to \mathbf{k}$, find a monochromatic $S \subseteq \mathbb{Q}$ such that $(S,<) \cong (\mathbb{Q},<)$''. The framework is Weihrauch reducibility. Our results answer some open questions recently raised by Gill, and by Dzhafarov, Solomon and Valenti. |
| title | More on the indivisibility of $\mathbb{Q}$ |
| topic | Logic Logic in Computer Science Combinatorics 03D30, 05C55 |
| url | https://arxiv.org/abs/2407.03722 |