Categoricity Properties for Computable Algebraic Fields
classification
🧮 math.LO
math.ACmath.NT
keywords
categoricitycomputablefieldsalgebraiccategoricalcomputablyclasscomplete
read the original 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 $\Pi^0_4$-complete.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.