Decidability of the theory of modules over Prüfer domains with dense value groups (Q2326429)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Decidability of the theory of modules over Prüfer domains with dense value groups
scientific article

    Statements

    Decidability of the theory of modules over Prüfer domains with dense value groups (English)
    0 references
    0 references
    0 references
    0 references
    7 October 2019
    0 references
    The authors define relations in a ring \(R\), called \(\mathrm{DPR}(R)\) (double prime radical relation) and \(\mathrm{PP}(R)\) (Point-Prest relation). They show that if \(R\) is an effectively given Prüfer domain such that each localisation at a maximal ideal has a dense value group, \(\mathrm{DPR}(R)\) and \(\mathrm{PP}(R)\) are recursive, then the theory of \(R\)-modules is decidable. In the case of effectively given Bezout domains with the same algebraic property, the decidability of the theory of \(R\)-modules is equivalent to the fact that the defined relations are recursive.
    0 references
    Prüfer domain
    0 references
    Bézout domain
    0 references
    dense value group
    0 references
    decidability
    0 references

    Identifiers

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