Scattered linear orderings with no computable presentation

DOI10.1134/S199508021401003XzbMath1325.03053MaRDI QIDQ2263069

Yanyan Li

Publication date: 17 March 2015

Published in: Lobachevskii Journal of Mathematics (Search for Journal in Brave)

zbMATH Keywords

scattered linear orderingscomputable presentations\(\text{low}_{n}\) presentations

Mathematics Subject Classification ID

Theory of numerations, effectively presented structures (03D45)

Related Items (8)

Initial segments of computable linear orders with computable natural relations ⋮ Algorithmic relationships of relations \(S_{\mathcal{L}}^n\) on linear orders ⋮ THE SIMPLEST LOW LINEAR ORDER WITH NO COMPUTABLE COPIES ⋮ On a computable presentation of low linear orderings ⋮ Computable linear orders and limitwise monotonic functions ⋮ Degree spectra of structures ⋮ Computable presentability of countable linear orders ⋮ Computable linear orders and the ershov hierarchy

Cites Work

• Unnamed Item
• Computability on linear orderings enriched with predicates
• Cuts of linear orders
• Degrees of orderings not isomorphic to recursive linear orderings
• Low linear orderings
• On Choice Sets and Strongly Non-Trivial Self-Embeddings of Recursive Linear Orders
• Δ 2 0 -copies of linear orderings

This page was built for publication: Scattered linear orderings with no computable presentation