Relations Intrinsically Recursive in Linear Orders
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 3882490
- A recursion principle for linear orderings
- Recursive linear orders with recursive successivities
- scientific article; zbMATH DE number 749928
- Linearization of definable order relations
- Recursive automorphisms of recursive linear orderings
- Recursive Linear Orders with Incomplete Successivities
- A construction for recursive linear orderings
Cited in
(14)- Recursive linear orders with recursive successivities
- Intrinsically \(\Sigma ^ 0_{\alpha}\) relations
- Structures computable in polynomial time. II
- Computable linear orders and the ershov hierarchy
- Algorithmic relationships of relations \(S_{\mathcal{L}}^n\) on linear orders
- The intrinsic enumerability of linear orders
- Computability of Fraïssé limits
- On the complexity of the successivity relation in computable linear orderings
- Degree spectra of relations on computable structures in the presence of Δ20isomorphisms
- Recursive Linear Orders with Incomplete Successivities
- Degree Spectra of Relations on Computable Structures
- scientific article; zbMATH DE number 1841839 (Why is no real title available?)
- The Complexity of intrinsically r.e. subsets of existentially decidable models
- Degrees of relations on canonically ordered natural numbers and integers
This page was built for publication: Relations Intrinsically Recursive in Linear Orders
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3712322)
