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...
Na minha lista:
| Autor principal: | |
|---|---|
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado em: |
Logical Methods in Computer Science e.V.
2025-06-01
|
| coleção: | Logical Methods in Computer Science |
| Assuntos: | |
| Acesso em linha: | http://lmcs.episciences.org/13563/pdf |
| Tags: |
Sem tags, seja o primeiro a adicionar uma tag!
|