Answers are grounded in this paper and cite their sources.
Uncovers a low scattered linear order with no computable copy, highlighting key properties.
One of the central themes in the computable theory of linear orders is determining which low orders are computably presentable. This, in turn, raises the question of which order properties guarantee a computable copy for any low order. In this paper, we investigate the property of being scattered by constructing a counterexample: a low scattered linear order of Hausdorff rank 2 that has no computable copy. This construction provides such a counterexample of minimal finite rank.
No takes yet. Share an insight, caveat, or question.
M. V. Zubkov (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: