On a computable presentation of low linear orderings

DOI10.1134/S1995080218090020zbMath1423.03148OpenAlexW2909191269MaRDI QIDQ669557

Juan-Miguel Gracia

Publication date: 15 March 2019

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

Full work available at URL: https://doi.org/10.1134/s1995080218090020

zbMATH Keywords

linear orderinglow degreecomputable presentationstrongly \({\eta}\)-like linear odering

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Computability on linear orderings enriched with predicates
• Linear orderings of low degree
• Cuts of linear orders
• Degrees of orderings not isomorphic to recursive linear orderings
• Computable shuffle sums of ordinals
• Scattered linear orderings with no computable presentation
• Computable Boolean algebras
• Low linear orderings
• Boolean algebra approximations
• Notes on the Jump of a Structure
• Increasing η -representable degrees
• On Choice Sets and Strongly Non-Trivial Self-Embeddings of Recursive Linear Orders
• Every Low Boolean Algebra is Isomorphic to a Recursive One
• Every Low 2 Boolean Algebra has a Recursive Copy
• Δ 2 0 -copies of linear orderings

This page was built for publication: On a computable presentation of low linear orderings