Showing math.LOShow all
2 papers · 1 filter
math.LO2023
Indivisibility and uniform computational strength
Kenneth Gill
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 corr…
math.LO2023
A note on the indivisibility of the Henson graphs
Kenneth Gill
We show that in contrast to the Rado graph, the Henson graphs are not computably indivisible.