Computably categorical fields via Fermat's last theorem

DOI10.3233/COM-13017zbMATH Open1408.03029arXiv1212.6751MaRDI QIDQ2851189FDOQ2851189

Authors: Hans Schoutens, Russell Miller 

Publication date: 10 October 2013

Published in: Computability (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1212.6751

Recommendations

• \(d\)-computable categoricity for algebraic fields
• Fields of algebraic numbers computable in polynomial time. I
• Categoricity properties for computable algebraic fields
• Polynomial computability of fields of algebraic numbers
• Computable categoricity for algebraic fields with splitting algorithms

zbMATH Keywords

fieldstranscendencecomputabilitycomputable categoricityFermat's last theorem

Mathematics Subject Classification ID

Categoricity and completeness of theories (03C35) Computable structure theory, computable model theory (03C57)

Cited In (10)

• Computable dimensions of Pappusian and Desarguesian projective planes
• Computable dimension for ordered fields
• A computable functor from graphs to fields
• Categoricity spectra of computable structures
• Categoricity properties for computable algebraic fields
• Computable procedures for fields
• \(d\)-computable categoricity for algebraic fields
• The complexity of computable categoricity
• Computable categoricity for algebraic fields with splitting algorithms
• Algebraic structures computable without delay

This page was built for publication: Computably categorical fields via Fermat's last theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2851189)