Indivisibility and uniform computational strength
A countable structure is indivisible if for every coloring with finite range there is a monochromatic isomorphic subcopy of the structure. Each indivisible structure naturally corresponds to an indivisibility problem which outputs such a subcopy given a presentation and coloring. We investigate the...
Guardat en:
| Autor principal: | |
|---|---|
| Format: | Artigo |
| Idioma: | Inglês |
| Publicat: |
Logical Methods in Computer Science e.V.
2025-06-01
|
| Col·lecció: | Logical Methods in Computer Science |
| Matèries: | |
| Accés en línia: | http://lmcs.episciences.org/13563/pdf |
| Etiquetes: |
Sense etiquetes, Sigues el primer a etiquetar aquest registre!
|