Codings on linear orders and algorithmic independence of natural relations

Codings on linear orders and algorithmic independence of natural relations

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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Lobachevskii journal of mathematics 2014-10, Vol.35 (4), p.327-332
1. Verfasser: Bikmukhametov, R. I.
Format: Artikel
Sprache:eng
Schlagworte:
Algebra
Analysis
Geometry
Mathematical Logic and Foundations
Mathematics
Mathematics and Statistics
Probability Theory and Stochastic Processes
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:1995-0802
1818-9962
DOI:10.1134/S1995080214040131