A construction for recursive linear orderings
From MaRDI portal
Publication:3984441
DOI10.2307/2274709zbMath0742.03013MaRDI QIDQ3984441
Publication date: 27 June 1992
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2274709
03C75: Other infinitary logic
03C57: Computable structure theory, computable model theory
03D45: Theory of numerations, effectively presented structures
Related Items
Mixed systems, There is no classification of the decidably presentable structures, Requirement systems, Definable Subsets of Polynomial-Time Algebraic Structures, INDECOMPOSABLE LINEAR ORDERINGS AND HYPERARITHMETIC ANALYSIS, Computability on linear orderings enriched with predicates, Recursive and r.e. quotient Boolean algebras, Inseparability in recursive copies, Enumerations in computable structure theory, Complexity of \(\Sigma^0_n\)-classifications for definable subsets, ON THE COMPLEXITY OF THE SUCCESSIVITY RELATION IN COMPUTABLE LINEAR ORDERINGS, Intrinsic bounds on complexity and definability at limit levels, Notes on the Jump of a Structure, Depth zero Boolean algebras
Cites Work