A construction for recursive linear orderings

DOI10.2307/2274709MaRDI QIDQ3984441zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• A recursion principle for linear orderings
• Linear Order Types of Nonrecursive Presentability
• Finite condensations of recursive linear orders
• scientific article; zbMATH DE number 749934

Cites work

• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• Labelling systems and r.e. structures
• Pairs of recursive structures

Cited in

(26)

• Linear Orders in the Pushdown Hierarchy
• Definable Subsets of Polynomial-Time Algebraic Structures
• A generalization of Tennenbaum's theorem on effectively finite recursive linear orderings
• Mixed systems
• Enumerations in computable structure theory
• scientific article; zbMATH DE number 3880666 (Why is no real title available?)
• INDECOMPOSABLE LINEAR ORDERINGS AND HYPERARITHMETIC ANALYSIS
• A recursion principle for linear orderings
• Recursive and r.e. quotient Boolean algebras
• Ranking functions and axioms for linear orders
• Complexity of \(\Sigma^0_n\)-classifications for definable subsets
• FINDING DESCENDING SEQUENCES THROUGH ILL-FOUNDED LINEAR ORDERS
• Requirement systems
• Computability on linear orderings enriched with predicates
• Notes on the Jump of a Structure
• Pairs of recursive structures
• scientific article; zbMATH DE number 176213 (Why is no real title available?)
• A theory of recursive dimension of ordered sets
• Inseparability in recursive copies
• Intrinsic bounds on complexity and definability at limit levels
• There is no classification of the decidably presentable structures
• Depth zero Boolean algebras
• Complexity of Winning Strategies for Δ 0 2 Games
• On the complexity of the successivity relation in computable linear orderings
• Relations Intrinsically Recursive in Linear Orders
• scientific article; zbMATH DE number 1116621 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3984441)