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 ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback