Categoricity Properties for Computable Algebraic Fields
Logic
2018-02-12 v2 Commutative Algebra
Number Theory
Abstract
We examine categoricity issues for computable algebraic fields. We give a structural criterion for relative computable categoricity of these fields, and use it to construct a field that is computably categorical, but not relatively computably categorical. Finally, we show that computable categoricity for this class of fields is -complete.
Cite
@article{arxiv.1111.1211,
title = {Categoricity Properties for Computable Algebraic Fields},
author = {Denis Hirschfeldt and Ken Kramer and Russell Miller and Alexandra Shlapentokh},
journal= {arXiv preprint arXiv:1111.1211},
year = {2018}
}
Comments
In an earlier version of this article, the authors claimed to have shown that computable algebraic fields cannot have finite computable dimension greater than 1. This claim was based on a theorem from another paper, and that theorem has now been retracted by its authors. Therefore, we have removed that claim from the current version of this article