Low scattered linear orders

DOI10.1093/LOGCOM/EXAE008MaRDI QIDQ6915777zbMATH OpenFDO

Authors Andrey Frolov, M. V. Zubkov

Publication date 15 October 2025

Published in Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/LOGCOM/EXAE008

zbMATH Keywords

computable presentationlow linear orderscattered linear order

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX) Computer science (68-XX)

Cites work

• A class of low linear orders having computable presentations
• Computability on linear orderings enriched with predicates
• Cuts of linear orders
• Degrees of orderings not isomorphic to recursive linear orderings
• scientific article; zbMATH DE number 3732037 (Why is no real title available?)
• scientific article; zbMATH DE number 3767656 (Why is no real title available?)
• scientific article; zbMATH DE number 1303201 (Why is no real title available?)
• Increasing η -representable degrees
• Linear orderings of low degree
• Low linear orderings
• Notes on the Jump of a Structure
• On Choice Sets and Strongly Non-Trivial Self-Embeddings of Recursive Linear Orders
• Scattered linear orderings with no computable presentation
• Sufficient conditions for the existence of 0'-limitwise monotonic functions for computable \(\eta\)-like linear orders
• Turing computability. Theory and applications
• Δ 2 0 -copies of linear orderings

Cited in

(1)

• A low scattered linear order of rank 2 without computable copy

This page was built for publication: Low scattered linear orders

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6915777)