Pages that link to "Item:Q3984441"
From MaRDI portal
The following pages link to A construction for recursive linear orderings (Q3984441):
Displaying 14 items.
- Computability on linear orderings enriched with predicates (Q431704) (← links)
- Recursive and r.e. quotient Boolean algebras (Q1325051) (← links)
- Inseparability in recursive copies (Q1326768) (← links)
- Enumerations in computable structure theory (Q2570135) (← links)
- Complexity of \(\Sigma^0_n\)-classifications for definable subsets (Q2700822) (← links)
- ON THE COMPLEXITY OF THE SUCCESSIVITY RELATION IN COMPUTABLE LINEAR ORDERINGS (Q3094355) (← links)
- Intrinsic bounds on complexity and definability at limit levels (Q3399191) (← links)
- Notes on the Jump of a Structure (Q3576069) (← links)
- Depth zero Boolean algebras (Q3581139) (← links)
- Mixed systems (Q4323050) (← links)
- There is no classification of the decidably presentable structures (Q4562439) (← links)
- Requirement systems (Q4836053) (← links)
- Definable Subsets of Polynomial-Time Algebraic Structures (Q5042236) (← links)
- INDECOMPOSABLE LINEAR ORDERINGS AND HYPERARITHMETIC ANALYSIS (Q5485751) (← links)
