Algorithmic Relationships of Relations $$S_{\mathcal{L}}^{n}$$ on Linear Orders
Ya. A. Mikhailovskaya · Lobachevskii Journal of Mathematics · 2022
Abstract We study an algorithmic relationships of special relations on linear orders. We give the condition for which there is a computable linear order with computable special relation such that its computable presentation has non-computable successors.