Computable linear orders and limitwise monotonic functions

DOI10.1007/S10958-021-05421-3OpenAlexW3170629276MaRDI QIDQ2036468

Yanyan Li

Publication date: 29 June 2021

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10958-021-05421-3

zbMATH Keywords

automorphismcomputable linear orderself-embeddinglimitwise monotonic functionlow degreeeffective presentation

Mathematics Subject Classification ID

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

Related Items (2)

Rogers semilattices of limitwise monotonic numberings ⋮ Computable presentability of countable linear orders

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computability on linear orderings enriched with predicates
• Initial segments of computable linear orders with additional computable predicates
• Linear orderings of low degree
• The block relation in computable linear orders
• Cuts of linear orders
• Strongly \(\eta \)-representable degrees and limitwise monotonic functions
• Degrees of orderings not isomorphic to recursive linear orderings
• Computable shuffle sums of ordinals
• Degree spectra of the successor relation of computable linear orderings
• Recursive automorphisms of recursive linear orderings
• On initial segments of computable linear orders
• The Kierstead's conjecture and limitwise monotonic functions
• Scattered linear orderings with no computable presentation
• Limitwise monotonic functions relative to the Kleene's ordinal notation system
• Sufficient conditions for the existence of 0'-limitwise monotonic functions for computable \(\eta\)-like linear orders
• Low linear orderings
• Automorphisms ofη-like computable linear orderings and Kierstead's conjecture
• ON THE COMPLEXITY OF THE SUCCESSIVITY RELATION IN COMPUTABLE LINEAR ORDERINGS
• Degree spectra of relations on computable structures in the presence of Δ₂⁰isomorphisms
• Increasing η -representable degrees
• On computable self-embeddings of computable linear orderings
• On Π₁-automorphisms of recursive linear orders
• On Choice Sets and Strongly Non-Trivial Self-Embeddings of Recursive Linear Orders
• Recursive Linear Orders with Incomplete Successivities
• Every Low Boolean Algebra is Isomorphic to a Recursive One
• Corrigendum: "On the complexity of the successivity relation in computable linear orderings"
• LIMITWISE MONOTONIC FUNCTIONS AND THEIR APPLICATIONS
• Limitwise monotonic functions, sets, and degrees on computable domains
• On Kierstead’s conjecture
• Δ 2 0 -copies of linear orderings
• η-representation of sets and degrees
• Hierarchies of Boolean algebras
• The constructive second number class
• On notation for ordinal numbers
• Partially Ordered Sets

This page was built for publication: Computable linear orders and limitwise monotonic functions