The logic of pseudo-\(S\)-integers
Let \(\{n_i\}\) be a sequence of natural numbers and let \(\{p_i\}\) be a listing of rational primes. Then an abelian group \(G=\{x\in \mathbb{Q}\mid \text{ord}_{p_i} \geq-n_i\}\) is called a group of pseudo-integers. The scope of this paper is to investigate the logical properties of such groups of pseudo-integers and the counterparts of such groups in global fields in the case the number of primes allowed to appear in the denominator is infinite. The author shows that, while the addition problem of any recursive group of pseudo-integers is decidable, the diophantine problem for some recursive groups of pseudo-integers with infinite number of primes allowed in the denominator, is not decidable. More precisely, there exist recursive groups of pseudo-integers, where an infinite number of primes are allowed to appear in the denominator, such that there is no uniform algorithm to decide whether a polynomial equation over \(\mathbb{Z}\) in several variables has solutions in the group (this result is obtained by giving a diophantine definition of \(\mathbb{Z}\) over these groups; the proof is based on the strong Hasse norm principle).
scientific article; zbMATH DE number 1123745