Categorical linearly ordered structures
DOI10.1016/j.apal.2019.05.004zbMath1435.03076WikidataQ127830912 ScholiaQ127830912MaRDI QIDQ2311213
Alexander G. Melnikov, Keng Meng Ng, Rodney G. Downey
Publication date: 10 July 2019
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apal.2019.05.004
computable structures; real closed fields; linear orderings; ordered abelian groups; computable ordinals; effective structure theory; hyperarithmetical categoricity
03D80: Applications of computability and recursion theory
03C57: Computable structure theory, computable model theory
03D45: Theory of numerations, effectively presented structures
03D75: Abstract and axiomatic computability and recursion theory
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The complexity of computable categoricity
- Independence in computable algebra
- The isomorphism problem for torsion-free abelian groups is analytic complete
- Computable structures and the hyperarithmetical hierarchy
- Degree spectra and computable dimensions in algebraic structures
- The computable dimension of ordered abelian groups
- A computability theoretic equivalent to Vaught's conjecture
- Degrees of categoricity of computable structures
- An introduction to computable model theory on groups and fields
- Computable completely decomposable groups
- Computable Ordered Abelian Groups and Fields
- Recursive Labelling Systems and Stability of Recursive Structures in Hyperarithmetical Degrees
- Recursively Categorical Linear Orderings
- Orderings with αth Jump Degree 0 (α)
- On a question of Kalimullin
- CONSTRUCTIVE ALGEBRAS I
- Computable Algebra, General Theory and Theory of Computable Fields
- COMPUTABLE FUNCTORS AND EFFECTIVE INTERPRETABILITY
- Effective categoricity of computable linear orderings
