Computable dimension for ordered fields
From MaRDI portal
Publication:283123
DOI10.1007/s00153-016-0478-7zbMath1343.03034OpenAlexW2294263022MaRDI QIDQ283123
Publication date: 13 May 2016
Published in: Archive for Mathematical Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00153-016-0478-7
Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45) Ordered fields (12J15) Model theory of fields (12L12)
Related Items
Analytic computable structure theory and $L^p$ spaces, Categoricity spectra of computable structures
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Lectures on formally real fields
- Generic copies of countable structures
- Autostability of models and Abelian groups
- Autostability of models
- Nilpotent groups of finite algorithmic dimension
- The computable dimension of ordered abelian groups
- Computably Categorical Fields via Fermat’s Last Theorem
- Computable categoricity of trees of finite height
- Computable Categoricity of Graphs with Finite Components
- d-computable categoricity for algebraic fields
- Effective content of field theory
- Recursively Categorical Linear Orderings
- A note on computable real fields
- Model Theory
- Effective model theory vs. recursive model theory