2000 character limit reached
Computably Categorical Fields via Fermat's Last Theorem (1212.6751v1)
Published 30 Dec 2012 in math.LO and cs.LO
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.