A class of low linear orders having computable presentations

DOI10.1007/s10469-023-09706-1OpenAlexW4386098132MaRDI QIDQ6072990

M. V. Zubkov

Publication date: 15 September 2023

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

Full work available at URL: https://doi.org/10.1007/s10469-023-09706-1

zbMATH Keywords

computable linear order\( \eta \)-presentationlow linear order

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Initial segments of computable linear orders with additional computable predicates
• Linear orderings of low degree
• Strongly \(\eta \)-representable degrees and limitwise monotonic functions
• A theorem on strongly \(\eta \)-representable sets
• Degrees of orderings not isomorphic to recursive linear orderings
• On initial segments of computable linear orders
• Sufficient conditions for the existence of 0'-limitwise monotonic functions for computable \(\eta\)-like linear orders
• Low linear orderings
• 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
• η-representation of sets and degrees
• Hierarchies of Boolean algebras