scientific article; zbMATH DE number 749934
From MaRDI portal
Publication:4764115
zbMATH Open0824.03020MaRDI QIDQ4764115FDOQ4764115
Authors: Michael Moses
Publication date: 1 May 1995
Title of this publication is not available (Why is that?)
Recommendations
Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)
Cited In (12)
- 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
- Title not available (Why is that?)
- Recursive linear orders with recursive successivities
- 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
- An undecidable linear order that is \(n\)-decidable for all \(n\)
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)