scientific article; zbMATH DE number 749934
From MaRDI portal
Publication:4764115
Recommendations
Cited in
(12)- An undecidable linear order that is \(n\)-decidable for all \(n\)
- A recursion principle for linear orderings
- Complexity of \(\Sigma^0_n\)-classifications for definable subsets
- On Choice Sets and Strongly Non-Trivial Self-Embeddings of Recursive Linear Orders
- Finite condensations of recursive linear orders
- On Π1-automorphisms of recursive linear orders
- Recursive linear orders with recursive successivities
- scientific article; zbMATH DE number 176213 (Why is no real title available?)
- Every recursive linear ordering has a copy in DTIME-SPACE(n,log(n))
- Linear Order Types of Nonrecursive Presentability
- Recursive properties of isomorphism types
- Recursive categoricity and recursive stability
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4764115)