Initial segments of computable linear orders with computable natural relations
We study the algorithmic complexity of natural relations on initial segments of computable linear orders. We prove that there exists a computable linear order with computable density relation such that its Π<sup>0</sup><sub>1</sub>-initial segment has no computable presentation with computable density relation. We also prove that the same holds for right limit and left limit relations.