The isomorphism problem for classes of computable fields (Q701725)

Identifying a computable structure \(M\) whose basic set is \(\omega\) with its atomic diagram, we say that a computable structure has index \(a\) if \(a\) is the number of a Turing machine that enumerates this diagram. If \(a\) is an index for \({\mathcal A}\), we write \({\mathcal A}={\mathcal A}_a\). The isomorphism problem for a class \(K\) of computable models is the set \(E(K)=\{(a,b)\mid {\mathcal A}_a,{\mathcal A}_b\in K \wedge {\mathcal A}_a\cong{\mathcal A}_b\}\). The author proves the set \(E(K)\) to be \(\Sigma^0_3\)-complete for the following classes \(K\): computable vector spaces over an infinite computable field, computable algebraically closed fields of fixed characteristic, computable Archimedian real closed fields; and when \(K\) is either the class of computable real closed fields or the class of computable fields of characteristic \(0\), he proves the set \(E(K)\) to be \(\Sigma^1_1\)-complete. As a corollary, it is obtained that there is no Friedberg numbering up to isomorphism of computable fields of characteristic \(0\).