Computably Categorical Fields via Fermat's Last Theorem
classification
🧮 math.LO
cs.LO
keywords
categoricalcomputablecomputablyfermatfieldinfinitetranscendencealgebraic
read the original abstract
We construct a computable, computably categorical field of infinite transcendence degree over the rational numbers, using the Fermat polynomials and assorted results from algebraic geometry. We also show that this field has an intrinsically computable (infinite) transcendence basis.
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.