Low linear orderings
We say that L is weakly eta-like if L/similar to is isomorphic to the natural ordering of rational numbers. We construct a computable presentation of any low weakly eta-like linear ordering with no strongly eta-like interval. Also we prove that there exists a noncomputably presentable low(2) weakly eta-like linear ordering with no strongly eta-like interval.
linear ordering computability computable presentations