This paper presents a decision procedure for a certain class of sentences of first order logic involving integral polynomials and a certain specific analytic transcendental function trans(x) in which the variables range over the real numbers. The list of transcendental functions to which our decision method directly applies includes exp(x), the exponential function with respect to base e, ln(x), the natural logarithm of x, and arctan(x), the inverse tangent function. The inputs to the decision procedure are prenex sentences in which only the outermost quantified variable can occur in the transcendental function. In the case trans(x)=exp(x), the decision procedure has been implemented in the computer logic system REDLOG. It is shown how to transform a sentence involving a transcendental function from a much wider collection of functions (such as hyperbolic and Gaussian functions, and trigonometric functions on a certain bounded interval) into a sentence to which our decision method directly applies. Closely related work is reported by Anai and Weispfenning (2000), Collins (1998), Maignan (1998), Richardson (1991), Strzebonski (in press) and Weispfenning (2000).
References
[1]
Achatz, M., September 2006. Deciding polynomial-exponential problems. Diploma Thesis, Universität Passau, D-94030 Passau, Germany.
Cylindrical algebraic decomposition i: basic algorithm. In: Caviness, B., Johnson, J. (Eds.), Texts and Monographs in Symbolic Computation, Springer, Wien, New York. pp. 136-151.
Quantifier elimination for real closed fields by cylindrical algebraic decomposition. In: Caviness, B., Johnson, J. (Eds.), Texts and Monographs in Symbolic Computation, Springer, Wien, New York. pp. 85-121.
Polynomial real root isolation by differentiation. In: Proceedings of the 1976 Symposium on Symbolic and Algebraic Computation SYMSAC¿76, ACM. pp. 15-25.
Real zeros of polynomials. In: Buchberger, B., Collins, G.E., Loos, R., Albrecht, R. (Eds.), Computer Algebra: Symbolic and Algebraic Manipulation, Springer-Verlag, Wien, New York. pp. 83-94.
Algorithms for polynomial real root isolation. In: Caviness, B., Johnson, J. (Eds.), Texts and Monographs in Symbolic Computation, Springer, Wien, New York. pp. 269-299.
Computing in algebraic extensions. In: Buchberger, B., Collins, G., Loos, R. (Eds.), Computer Algebra: Symbolic and Algebraic Computation, Springer, Wien, New York. pp. 173-188.
Maignan, A., August 1998. Solving one and two-dimensional exponential polynomial systems. In: Gloor, O. (Ed.), Proceedings of the 1998 International Symposium on Symbolic and Algebraic Computation. New York, pp. 215-221.
Pericleous, S., Vorobjov, N., July 2001. New complexity bounds for cylindrical decompositions of sub-pfaffian sets. In: Mourrain, B. (Ed.), Proceedings of the 2001 International Symposium on Symbolic and Algebraic Computation. New York, pp. 268-275.
Richardson, D., July 1991. Towards computing non algebraic cylindrical decompositions. In: Watt, S.M. (Ed.), Proceedings of the 1991 International Symposium on Symbolic and Algebraic Computation. Bonn, Germany, pp. 247-255.
Seidl, A., November 2006. Cylindrical decomposition under application-oriented paradigms. Doctoral Dissertation, Universität Passau, D-94030 Passau, Germany.
Strzebonski, A., July 2008. Real root isolation for exp-log functions. In: Jeffrey, D. (Ed.), Proceedings of the 2008 International Symposium on Symbolic and Algebraic Computation. Linz, Austria, pp. 303-313.
Strzebonski, A., July 2009. Real root isolation for tame elementary functions. In: May, J. (Ed.), Proceedings of the 2009 International Symposium on Symbolic and Algebraic Computation. Seoul, Korea, pp. 341-350.
A decision method for elementary algebra and geometry. In: Caviness, B., Johnson, J. (Eds.), Texts and Monographs in Symbolic Computation, Springer, Wien, New York. pp. 24-84.
Chen RXia B(2024)Reduction of Transcendental Decision Problems over the RealsProceedings of the 2024 International Symposium on Symbolic and Algebraic Computation10.1145/3666000.3669675(56-64)Online publication date: 16-Jul-2024
Chen RLi HXia BZhao TZheng T(2024)Isolating all the real roots of a mixed trigonometric-polynomialJournal of Symbolic Computation10.1016/j.jsc.2023.102250121:COnline publication date: 1-Mar-2024
ISSAC '08: Proceedings of the twenty-first international symposium on Symbolic and algebraic computation
This paper presents a decision procedure for a certain class of sentences of first order logic involving integral polynomials and the exponential function in which the variables range over the real numbers. The inputs to the decision procedure are ...
Sturm's theorem is a well-known result in real algebraic geometry that provides a function that computes the number of roots of a univariate polynomial in a semi-open interval, not counting multiplicity. A generalization of Sturm's theorem is known as ...
Quantifier elimination is a foundational issue in the field of algebraic and logic computation. In first-order logic, every formula is well composed of atomic formulas by negation, conjunction, disjunction, and introducing quantifiers. It is often made ...
The theory of quantifier elimination over real closed fields goes back to Tarski [1], though practical methods had to wait for Collins in 1975 [2]. Given a formula Q 1 x 1, ..., Q k x k φ( x 1, ..., x n ) (where each Q i is either ∃ or is ∀, and φ is a Boolean combination of equalities and inequalities between polynomials), an equivalent formula ψ( x k +1, ..., x n ) is produced. In particular, if k = n , we get either "true" or "false." Expressions like √ x 2 - 1 can be handled by writing them as y and adding ∧ y 2 = x 2-1, for example. How can we add transcendental functions__?__
The authors first consider problems of the form Q 1 x 1 φ( x 1, trans( x 1)), where trans is a strongly transcendental function with a suitably neat algebraic relationship between trans and trans'. Log, exp, and arctan all satisfy these requirements. Here, they produce an unconditional algorithm for reducing this to "true" or "false." Here, "unconditional" means not relying on Schanuel's conjecture [3] or equivalent hard problems in number theory, and it is this unconditionality that is the most surprising part of the work. This will, for example, decide ∀ x 1(exp( x 1))(1- x 1) ? 1 x 1 ≥ 1, and will in fact do so in less than one second.
The authors then take problems of the form Q 1 x 1 Q 2 x 2 ... Q n x n φ( x 1,trans( x 1), x 2, ..., x n ), apply the Collins-style quantifier elimination to Q 2, x 2, ... Q n x n φ( x 1, y , x 2 ... x n ) to get φ( x 1, y ), and apply their previous method to Q 1 x φ( x , trans( x )). Again, the process is unconditional. They also show how various other problems, such as ∀ x x >⇒ cosh( x )> x 3-4 x , can be transformed into this form and decided (in 17 seconds).
While this is a significant step forward, we should note that we are limited to one occurrence of "trans," and this has to be the first quantifier. Also, this is purely a decision procedure, and will not do more general quantifier elimination.
Online Computing Reviews Service
Access critical reviews of Computing literature here
Chen RXia B(2024)Reduction of Transcendental Decision Problems over the RealsProceedings of the 2024 International Symposium on Symbolic and Algebraic Computation10.1145/3666000.3669675(56-64)Online publication date: 16-Jul-2024
Chen RLi HXia BZhao TZheng T(2024)Isolating all the real roots of a mixed trigonometric-polynomialJournal of Symbolic Computation10.1016/j.jsc.2023.102250121:COnline publication date: 1-Mar-2024
Barbagallo MJeronimo GSabia J(2024)Decision problem for a class of univariate Pfaffian functionsApplicable Algebra in Engineering, Communication and Computing10.1007/s00200-022-00545-835:2(207-232)Online publication date: 1-Mar-2024
Chen RXia B(2023)Deciding first-order formulas involving univariate mixed trigonometric-polynomialsProceedings of the 2023 International Symposium on Symbolic and Algebraic Computation10.1145/3597066.3597104(145-154)Online publication date: 24-Jul-2023
Huang CMaza MZhi L(2022)Explicit Bounds for Linear Forms in the Exponentials of Algebraic NumbersProceedings of the 2022 International Symposium on Symbolic and Algebraic Computation10.1145/3476446.3536170(371-379)Online publication date: 4-Jul-2022
Barthe GJacomme CKremer S(2021)Universal Equivalence and Majority of Probabilistic Programs over Finite FieldsACM Transactions on Computational Logic10.1145/348706323:1(1-42)Online publication date: 22-Nov-2021
Barthe GChadha RKrogmeier PSistla AViswanathan M(2021)Deciding accuracy of differential privacy schemesProceedings of the ACM on Programming Languages10.1145/34342895:POPL(1-30)Online publication date: 4-Jan-2021
Chadha RSistla AViswanathan MGorla D(2021)On linear time decidability of differential privacy for programs with unbounded inputsProceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science10.1109/LICS52264.2021.9470708(1-13)Online publication date: 29-Jun-2021