Computable dimension for ordered fields (Q283123): Difference between revisions

It is a natural question to ask whether the various effective presentations of a computable structure are somewhat equivalent. This can be phrased in terms of computable dimension: the computable dimension of a computable structure is the number of distinct computable presentations of the structure, up to computable isomorphism. A computable structure is computably categorical if it has computable dimension 1. The question has been studied for various structures, but it seems not so much is known for fields. Some recent work of Miller, Park, Poonen, Schoutens and Shlapentokh seems to have open the horizon by constructing a fully faithfull functor from graphs to fields, allowing to associate to a computable graph a computable field with the same essential computable-model-theoretic properties. The present paper considers computable ordered fields. The main results are: {\parindent=7mm \begin{itemize}\item[(1)] Every computable ordered field of finite transcendence degree is computably stable, i.e., for every other computable ordered field \(B\), any classical isomorphism from the original field to \(B\) is in fact computable, and this yield computable dimension 1. \item[(2)] There are computable ordered fields of infinite transcendence degree which have infinite computable dimension, but others with computable dimension 1. \item[(3)] Archimedean computable ordered fields having finite computable dimension must in fact have dimension 1.\end{itemize}}