THE SIMPLEST LOW LINEAR ORDER WITH NO COMPUTABLE COPIES
A. N. Frolov, M. V. Zubkov · Journal of Symbolic Logic · 2022
Abstract A low linear order with no computable copy constructed by C. Jockusch and R. Soare has Hausdorff rank equal to $2$ . In this regard, the question arises, how simple can be a low linear order with no computable copy from the point of view of the linear order type? The main result of this work is an example of a low strong $\eta $ -representation with no computable copy that is the simplest possible example.