A construction for recursive linear orderings

DOI10.2307/2274709zbMath0742.03013OpenAlexW2166082757MaRDI QIDQ3984441

C. J. Ash

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

zbMATH Keywords

recursive order typeswinning strategies in effective games

Mathematics Subject Classification ID

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

Related Items (14)

Inseparability in recursive copies ⋮ Definable Subsets of Polynomial-Time Algebraic Structures ⋮ There is no classification of the decidably presentable structures ⋮ Requirement systems ⋮ Mixed systems ⋮ Computability on linear orderings enriched with predicates ⋮ Complexity of \(\Sigma^0_n\)-classifications for definable subsets ⋮ Notes on the Jump of a Structure ⋮ Depth zero Boolean algebras ⋮ ON THE COMPLEXITY OF THE SUCCESSIVITY RELATION IN COMPUTABLE LINEAR ORDERINGS ⋮ Intrinsic bounds on complexity and definability at limit levels ⋮ INDECOMPOSABLE LINEAR ORDERINGS AND HYPERARITHMETIC ANALYSIS ⋮ Enumerations in computable structure theory ⋮ Recursive and r.e. quotient Boolean algebras

Cites Work

• Pairs of recursive structures
• Labelling systems and r.e. structures
• Unnamed Item

This page was built for publication: A construction for recursive linear orderings