Computably Categorical Fields via Fermat's Last Theorem
Logic
2018-02-12 v1 Logic in Computer Science
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.
Cite
@article{arxiv.1212.6751,
title = {Computably Categorical Fields via Fermat's Last Theorem},
author = {Russell Miller and Hans Schoutens},
journal= {arXiv preprint arXiv:1212.6751},
year = {2018}
}
Comments
to appear in the journal Computability