Initial segments of computable linear orders with additional computable predicates

DOI10.1007/s10469-009-9068-7zbMath1241.03056OpenAlexW2036754289MaRDI QIDQ431706

M. V. Zubkov

Publication date: 29 June 2012

Published in: Algebra and Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10469-009-9068-7

zbMATH Keywords

computable linear ordercomputabilityrecursivenessinitial segment

Mathematics Subject Classification ID

Total orders (06A05) Theory of numerations, effectively presented structures (03D45)

Related Items

Initial segments of computable linear orders with computable natural relations ⋮ Algorithmic relationships of relations \(S_{\mathcal{L}}^n\) on linear orders ⋮ A computably enumerable partial ordering without computably enumerable maximal chains and antichains ⋮ Punctual 1-linear orders ⋮ A class of low linear orders having computable presentations ⋮ Codings on linear orders and algorithmic independence of natural relations ⋮ Computable linear orders and limitwise monotonic functions ⋮ \(\Sigma_{2}^{0}\)-initial segments of computable linear orders ⋮ Computable linear orders and the ershov hierarchy

Cites Work

• Unnamed Item
• Unnamed Item
• Initial segments of recursive linear orders
• On initial segments of computable linear orders
• Recursive Pseudo-Well-Orderings