A computable graph has cohesive powers of degree 0'' over Δ2 cohesive sets, and a computable linear order has cohesive powers with no computable presentation.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.LO 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Tennenbaum-like theorems for cohesive powers
A computable graph has cohesive powers of degree 0'' over Δ2 cohesive sets, and a computable linear order has cohesive powers with no computable presentation.