Decidability of Finite Field Extensions
Status Open · unsolvedmath.comLLM status Open unverified
Top Open Problems Not reported cataloguedOpenOpenStatement
Definitions and mathematical statement
The source asks whether every finite extension of a decidable field is decidable. It does not specify a logical language. Under the usual interpretation using the pure first-order language of rings $\mathcal L_{\mathrm{ring}}=\{0,1,+,-,\cdot\}$, define \[ \operatorname{Th}_{\mathrm{ring}}(F)=\{\varphi:\varphi\text{ is an }\mathcal L_{\mathrm{ring}}\text{-sentence and }F\models\varphi\}. \] A field $F$ is called decidable in this interpretation if an algorithm, given any $\mathcal L_{\mathrm{ring}}$-sentence, determines whether it belongs to $\operatorname{Th}_{\mathrm{ring}}(F)$. This concerns the complete theory, without requiring a computable presentation of $F$. For an extension of fields $K\subseteq L$, its degree is $[L:K]=\dim_K L$, and it is finite when this dimension is finite.With this language qualification, the original question asks whether \[ \forall\,K\subseteq L\text{ fields},\qquad \left(\operatorname{Th}_{\mathrm{ring}}(K)\text{ is decidable}\ \land\ [L:K]<\infty\right) \Longrightarrow \operatorname{Th}_{\mathrm{ring}}(L)\text{ is decidable}. \] There is no restriction on characteristic in the supplied statement. The assertion concerns decidability for each individual extension; it does not specify a uniform algorithm for all extensions.
Unresolved source qualification. The registry labels the record open, but its supplied statement-verification note says that the official report answers this question negatively by constructing a decidable field with an undecidable finite extension. Under the interpretation above, that reported negative answer would have the form \[
\exists\,K\subseteq L\text{ fields}:\quad
[L:K]<\infty,\qquad
\operatorname{Th}_{\mathrm{ring}}(K)\text{ is decidable},\qquad
\operatorname{Th}_{\mathrm{ring}}(L)\text{ is undecidable}.
\] This is a transcription of the supplied verification claim, not an independently verified result. The record marks its statement status as unrecoverable and supplies no clean replacement statement. Consequently, the displayed universal implication is preserved as the original question, with conflicting status information explicitly retained; it is not presented as a verified open problem.
Short English statement
The original question asks whether a finite field extension always preserves decidability of the complete first-order theory, provisionally read in the pure language of rings. The supplied registry contains conflicting status information: its open label and dated literature assessment coexist with a verification note reporting a negative answer. This statement-only draft requires human mathematical and source review.Sources
- Local UnsolvedMath registry record, permanent ID $30003830$, title "Decidability of Finite Field Extensions," exact source problem code
catalogue entry; registry locationdata/unsolvedmath/problems.json. No individual proposer is supplied. The recorded proposed year is 2018. - Supplied report citation: Field Arithmetic (2019), Oberwolfach Reports, DOI 10.4171/owr/2018/25, pp. 1517--1577. https://doi.org/10.4171/owr/2018/25. The supplied background describes Oberwolfach Reports as documenting mathematical workshops and their open-problem discussions.
- Supplied literature source labeled "Oberwolfach Report 2019": https://ems.press/content/serial-article-files/46747.
- Supplied literature source labeled "Anscombe--Fehm": https://doi.org/10.2140/ant.2016.10.665. The record supplies no title or precise passage connecting this reference to the question.
- Literature assessment checked at
2026-08-21: this is supplied dated curation, not independently verified. It labels the status open and says that the cited list remains a frontier for complete first-order decidability, with only restricted fragments and related languages settled. The background explicitly calls this dated literature triage derived from the supplied OWR curation and requests independent verification of time-sensitive status and cited claims. - The supplied statement-verification note reports a negative answer in the official report and says that this extraction is not an unresolved problem. It states that no separate clean statement is promoted and that the original record remains publicly visible for provenance. The record's statement status is
unrecoverable. These supplied qualifications conflict with its open status and literature assessment; no source was independently consulted for this draft.
Statement licence: CC-BY-SA-4.0 · Source file
Contributions 0
No attempts yet. Significant partial results and substantial reductions are welcome. Contribute an attempt.