×

Nonsingular Hasse principle for rings. (English) Zbl 0959.03021

We introduce and study a local global principle for rings called LGPH, analogous to the nonsingular Hasse principle. The class of rings satisfying LGPH has been proved to contain many rings which occur naturally, such as the integral closure of the ring of integers inside any local field. We prove that LGPH is recursively axiomatisable in the language of rings, and derive from that a natural recursive axiomatisation of the ring of all \(p\)-adic algebraic integers, that is the integral closure of the ring of integers inside the field of \(p\)-adic numbers. Moreover the theory of that ring in a definable enrichment of the language of rings (one binary relation symbol being added) is proved to be model-complete. As an application we obtain that this ring has a decidable complete theory.

MSC:

03C60 Model-theoretic algebra
11R04 Algebraic numbers; rings of algebraic integers
03C10 Quantifier elimination, model completeness, and related topics
03B25 Decidability of theories and sets of sentences
Full Text: DOI

References:

[1] L. DarnieAre, EAtude modeAle-theAorique d’anneauxsatisfaisant un principe de Hasse non singulier, Phd thesis, UniversiteA de Rennes 1, January 1998.
[2] Math. 388 pp 189– (1988)
[3] van den Dries L., Math. 407 pp 33– (1990)
[4] Alg. Log. 31 (6) pp 342– (1992)
[5] Ershov Y.-L., Alg. Log. 33 pp 205– (1994)
[6] Heinemann B., Canad. Math. Soc. Conf. Proc. 4 pp 297– (1984)
[7] Ec. Norm. Sup. 22 (4) pp 181– (1989)
[8] Prestel A., Springer Lect. Notes Math. pp 1050– (1984)
[9] Prestel A., Math. 407 pp 178– (1990)
[10] Prestel A., Math. 414 pp 141– (1991)
[11] Math. 368 pp 127– (1986)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.