THE SIMPLEST LOW LINEAR ORDER WITH NO COMPUTABLE COPIES

DOI10.1017/jsl.2022.44OpenAlexW4281963904MaRDI QIDQ6123581

M. V. Zubkov, Andrei N. Frolov

Publication date: 5 April 2024

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/jsl.2022.44

zbMATH Keywords

linear ordercomputable presentation\( \eta \)-representationlow Turing degree

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)

Cites Work

• Unnamed Item
• Computability on linear orderings enriched with predicates
• Linear orderings of low degree
• Cuts of linear orders
• Strongly \(\eta \)-representable degrees and limitwise monotonic functions
• A theorem on strongly \(\eta \)-representable sets
• Degrees of orderings not isomorphic to recursive linear orderings
• Logic year 1979--80, The University of Connecticut, USA
• Scattered linear orderings with no computable presentation
• Sufficient conditions for the existence of 0'-limitwise monotonic functions for computable \(\eta\)-like linear orders
• Low linear orderings
• 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
• LIMITWISE MONOTONIC FUNCTIONS AND THEIR APPLICATIONS
• Limitwise monotonic functions, sets, and degrees on computable domains
• Δ 2 0 -copies of linear orderings
• Hierarchies of Boolean algebras

This page was built for publication: THE SIMPLEST LOW LINEAR ORDER WITH NO COMPUTABLE COPIES