Regularly r-closed fields (Q796579)

From MaRDI portal





scientific article; zbMATH DE number 3865437
Language Label Description Also known as
default for all languages
No label defined
    English
    Regularly r-closed fields
    scientific article; zbMATH DE number 3865437

      Statements

      Regularly r-closed fields (English)
      0 references
      1983
      0 references
      The author investigates model-theoretic properties of regulary r-closed fields [i.e. pseudo real closed fields, cf. \textit{A. Prestel}, Lect. Notes Math. 872, 127-156 (1981; Zbl 0466.12018)] (F,P), where F is a preordered field with a positive cone P. The main results of the paper concern classes \({\mathfrak P}({\mathfrak G})\) and \({\mathfrak P}^*({\mathfrak G})\), where for a class \({\mathfrak G}\) of involutory groups the class \({\mathfrak P}({\mathfrak G})\) (\({\mathfrak P}^*({\mathfrak G}))\) consists of preordered fields (regulary r- closed fields) (F,P) such that the involutory group G(F,P) of (F,P) is a \({\mathfrak G}\)-group (universal \({\mathfrak G}\)-group). If (F,P) is considered as a model of signature \(\sigma_ 1=\sigma_ f\cup \{P^ 1\}\cup \{w_ 2,...,w_ k,..\},\) where \(\sigma_ f\) is a signature of fields and \(w_ k(x_ 1,...,x_ k):=(\exists x)\quad(x^ k+x_ 1 x^{k- 1}+...+x_ k=0)\) the author proves that \({\mathfrak P}({\mathfrak G})\) and \({\mathfrak P}^*({\mathfrak G})\) are axiomatizable and T\(h({\mathfrak P}^*({\mathfrak G}))\) is a model companion for T\(h({\mathfrak P}({\mathfrak G}))\). Moreover, T\(h({\mathfrak P}^*({\mathfrak G}))\) is decidable iff \({\mathfrak G}\) is a recursive class.
      0 references
      regularly closed fields
      0 references
      pseudo real closed fields
      0 references
      preordered field
      0 references
      positive cone
      0 references
      axiomatizable
      0 references
      decidable
      0 references
      recursive class
      0 references
      0 references

      Identifiers

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