Provability and Decidability of Arithmetical Universal-Existential Sentences
Shih‐Ping Tung · Bulletin of the London Mathematical Society · 1986
From Godel's result on the incompleteness of the elementary theory of natural numbers N, we know that the elementary theory of N and the elementary theory of the integers Z are undecidable. J. Robinson [4] also proved that the elementary theory of rational numbers Q is undecidable. It seems that it is unreasonable to consider the