A HOL decision procedure for elementary real algebra
The elementary theory of real algebra, including multiplication, is decidable. More precisely, there is an algorithm to eliminate quantifiers which does not introduce new free variables or new constants other than rational numbers. Therefore if a closed term of elementary real algebra involves no constants other than the rational numbers, its truth or falsity can be determined automatically. Quite a number of interesting algebraic and geometric problems can be expressed in this decidable subset. In this paper we describe a HOL implementation of a quantifier-elimination procedure and give some preliminary results.
Unable to display preview. Download preview PDF.
- R. J. Boulton, The HOL arith library, in HOL System Libraries reference manual, distributed with HOL version 2.01.Google Scholar
- P. J. Cohen, Decision Procedures for Real and p-adic Fields, Communications in Pure and Applied Mathematics vol. 22, pp. 131–151, 1969.Google Scholar
- G. E. Collins, Quantifier Elimination for Real Closed Fields by Cylindrical Algebraic Decomposition, Second GI Conference on Automata Theory and Formal Languages, Springer Lecture Notes in Computer Science vol. 33, pp. 134–183, 1975.Google Scholar
- E. Engeler, The Foundations of Mathematics, Springer 1993.Google Scholar
- G. Kreisel, J. L. Krivine, Elements of Mathematical Logic, 2nd revised printing, North-Holland 1971.Google Scholar
- A. Seidenberg, A New Decision Method for Elementary Algebra, Annals of Mathematics vol. 60, pp. 365–374, 1954.Google Scholar
- A. Tarski, A Decision Method for Elementary Algebra and Geometry, University of California Press 1951.Google Scholar
- N. J. Vorobjov (Jr.), Deciding Consistency of Systems of Polynomial in Exponent Inequalities in Subexponential Time, Proceedings of the MEGA-90 Symposium on Effective Methods in Algebraic Geometry, Progress in Mathematics vol. 94, Birkhäuser 1991.Google Scholar
- B. L. van der Waerden, Algebra, vol. I, 7th edition, Springer-Verlag 1966.Google Scholar