Linear orderings of low degree

DOI10.1007/s11202-010-0091-7zbMath1209.03032MaRDI QIDQ610306

Sumit K. Garg

Publication date: 8 December 2010

Published in: Siberian Mathematical Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11202-010-0091-7

zbMATH Keywords

complexity; order type; linear ordering; computable representation; low degree

Mathematics Subject Classification ID

06A05: Total orders

03D45: Theory of numerations, effectively presented structures

Related Items

Punctual 1-linear orders, A class of low linear orders having computable presentations, Initial segments of computable linear orders with computable natural relations, On a computable presentation of low linear orderings, A computably enumerable partial ordering without computably enumerable maximal chains and antichains, Computable linear orders and the Ershov hierarchy, Computable linear orders and limitwise monotonic functions, Degree spectra of structures, Computable presentability of countable linear orders, Computable linear orders and the ershov hierarchy, Algorithmic relationships of relations \(S_{\mathcal{L}}^n\) on linear orders, Sufficient conditions for the existence of 0'-limitwise monotonic functions for computable \(\eta\)-like linear orders

Cites Work

• Unnamed Item
• Unnamed Item
• Degrees of orderings not isomorphic to recursive linear orderings
• On Choice Sets and Strongly Non-Trivial Self-Embeddings of Recursive Linear Orders
• Every Low Boolean Algebra is Isomorphic to a Recursive One
• Δ 2 0 -copies of linear orderings