Initial segments of computable linear orders with computable natural relations segments of computable linear orders. We prove that there exists a computable linear order with computable
Initial segments of computable linear orders with additional computable predicates -initial
segment which is isomorphic to no computable order with a computable neighborhood predicate
The Schwarz problem for infinite sets of intervals of countable sets of
segments with limit point at infinity, including the periodic case. The solution is a