Computable valued fields (Q1661672)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Computable valued fields
scientific article

    Statements

    Computable valued fields (English)
    0 references
    16 August 2018
    0 references
    This article is a study of valued fields from the perspective of computable algebra and consider the problem of extending a valuation of a field \(F\) to a valuation of an algebraic extension \(K\) of \(F\). The main result is: Theorem 1. Let \((K, v)\) be a computable algebraic valued field. Then, the following are equivalent: \begin{itemize} \item[1.] for every computable embedding \(\tau: K \rightarrow L\) of \(K\) into a field \(L\) algebraic over \(K\), there is a computable extension of \(v\) to a computable valuation \(w\) on \(L\), \item[2.] the Hensel irreducibility set \(H_K:= \{ f = x^n + a_{n-1}x^{n-1} + a_{n-2}x^{n-2} +\dots +a_0 \in \mathcal{O}_K[x]: f\) is irreducible over \(K,\ v(a_{n-1}) = 0\), and \(v(a_{n-2}), \dots , v(a_0) > 0\}\) of \((K, v)\) is computable \end{itemize} Theorem 2. There is a computable formally \(p\)-adic field which does not embed into a computable \(p\)-adic closure. Theorem 3. Let \((K, v)\) be a computable formally \(p\)-adic valued field with value group \(\Gamma\). Suppose that for each \(\gamma\in\Gamma\) and \(k \in\mathcal{N}\) we can compute whether \(\gamma\) is divisible by \(k\). Then there is a computable embedding of K into a computable \(p\)-adic closure \((L,w)\). Theorem 4 (Mal'cev property). Every computable algebraically closed valued field or \(p\)-adically closed valued field \(K\) of infinite transcendence degree has a computable copy \(G\cong_{\Delta^0_2} K\) with a computable transcendence base and a computable copy K \(B\cong_{\Delta^0_2} K\) with no computable transcendence base.
    0 references
    computable model theory
    0 references
    valued fields
    0 references
    extending valuations
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references