A construction for recursive linear orderings

DOI10.2307/2274709zbMATH Open0742.03013OpenAlexW2166082757MaRDI QIDQ3984441FDOQ3984441

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

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

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)

Cites Work

• Title not available (Why is that?)
• Pairs of recursive structures
• Labelling systems and r.e. structures

Cited In (26)

• Mixed systems
• Enumerations in computable structure theory
• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• Definable Subsets of Polynomial-Time Algebraic Structures
• Linear Orders in the Pushdown Hierarchy
• A generalization of Tennenbaum's theorem on effectively finite recursive linear orderings

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)