Abstract
Tarski-Seidenberg principle plays a key role in many applications and algorithm of computer algebra. Moreover it is constructive, and some very efficient quantifier elimination algorithms appeared recently. However, Tarski-Seidenberg principle is wrong for first-order theories involving some real analytic functions (e.g. an exponential function). In this case a weaker statement is sometimes true, a possibility to eliminate one sort of quantifiers (either ∀ or ∃). We construct a new algorithm for a cylindrical cell decomposition of a closed cube In ⊄ Rn compatible with a semianalytic subset S ⊄ In, defined by Pfaffian functions. In particular the algorithm is able to eliminate one sort of quantifiers from a first-order formula. The complexity bound of the algorithm is doubly exponential in n2.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
