In this paper, we prove the decidability of the theory of ℚp in the language (+, −, ·, 0, 1, Pn(n ∈ â„•)) expanded by a predicate for the multiplicative subgroup nℤ (where n is a fixed integer). There ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results