Computably Categorical Fields via Fermat’s Last Theorem
From MaRDI portal
Publication:2851189
DOI10.3233/COM-13017zbMath1408.03029arXiv1212.6751MaRDI QIDQ2851189
Hans Schoutens, Russell G. Miller
Publication date: 10 October 2013
Published in: Computability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1212.6751
03C57: Computable structure theory, computable model theory
03C35: Categoricity and completeness of theories
Related Items
A COMPUTABLE FUNCTOR FROM GRAPHS TO FIELDS, Computable categoricity for algebraic fields with splitting algorithms, Categoricity properties for computable algebraic fields, Computable dimension for ordered fields, The complexity of computable categoricity, Algebraic structures computable without delay, Computable dimensions of Pappusian and Desarguesian projective planes