Decision algorithms for fragments of real analysis. II. A theory of differentiable functions with convexity and concavity predicates
Preprint
Abstract
We address the decision problem for a fragment of real analysis involving differentiable functions with continuous first derivatives. The proposed theory, besides the operators of Tarski's theory of reals, includes predicates for comparisons, monotonicity, convexity, and derivative of functions over bounded closed intervals or unbounded intervals. Our decision algorithm is obtained by showing that satisfiable formulae of our theory admit canonical models in which functional variables are interpreted as piecewise exponential functions. These can be implicitly described within the decidable Tarski's theory of reals. Our satisfiability test generalizes previous decidability results not involving derivative operators.Keywords
All Related Versions
This publication has 7 references indexed in Scilit:
- The TPTP Problem Library, Release v1.2.0Logic Journal of the IGPL, 1995
- IMPS: An interactive mathematical proof systemJournal of Automated Reasoning, 1993
- On the Theoretical and Practical Complexity of the Existential Theory of RealsThe Computer Journal, 1993
- Decision algorithms for some fragments of analysis and related areasCommunications on Pure and Applied Mathematics, 1987
- Contributions to the Theory of Transcendental Numbers1984
- Decision procedures for elementary sublanguages of set theory. I. Multi‐level syllogistic and some extensionsCommunications on Pure and Applied Mathematics, 1980
- Some undecidable problems involving elementary functions of a real variableThe Journal of Symbolic Logic, 1969