Codings on linear orders and algorithmic independence of natural relations

Abstract

© 2014, Pleiades Publishing, Ltd. We study an algorithmic dependence of natural relations on linear orders relative to the class of their computable presentations. We give complete description of possible combinations of natural relations for which there is a computable linear order such that in any of its computable presentation a given combination of relations is not computable.