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) Other infinitary logic (03C75) Theory of numerations, effectively presented structures (03D45)

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

(30)

• Ranking functions and axioms for linear orders
• Recursive and r.e. quotient Boolean algebras
• Inseparability in recursive copies
• A theory of recursive dimension of ordered sets
• 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
• scientific article; zbMATH DE number 3880666 (Why is no real title available?)
• Intrinsic bounds on complexity and definability at limit levels
• Notes on the Jump of a Structure
• Depth zero Boolean algebras
• Linear Orders in the Pushdown Hierarchy
• A generalization of Tennenbaum's theorem on effectively finite recursive linear orderings
• Relations Intrinsically Recursive in Linear Orders
• A recursion principle for linear orderings
• Complexity of Winning Strategies for Δ 0 2 Games
• scientific article; zbMATH DE number 176213 (Why is no real title available?)
• Computability on linear orderings enriched with predicates
• Mixed systems
• scientific article; zbMATH DE number 1116621 (Why is no real title available?)
• There is no classification of the decidably presentable structures
• Requirement systems
• Definable Subsets of Polynomial-Time Algebraic Structures
• FINDING DESCENDING SEQUENCES THROUGH ILL-FOUNDED LINEAR ORDERS
• INDECOMPOSABLE LINEAR ORDERINGS AND HYPERARITHMETIC ANALYSIS
• Scott sentence complexities of linear orderings
• Complexity of well-ordered sets in an ordered abelian group
• Feferman's completeness theorem
• The coding theorems for linear orders
• Pairs of recursive structures

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)