Decision algorithms for fragments of real analysis. I: Continuous functions with strict convexity and concavity predicates

DOI10.1016/j.jsc.2006.02.003zbMath1125.03009OpenAlexW2057337329MaRDI QIDQ2457362

Gianluca Cincotti, Giovanni Gallo, Domenico Cantone

Publication date: 23 October 2007

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jsc.2006.02.003

zbMATH Keywords

monotonicityconcavityconvexitydecision algorithmselementary analysis

Mathematics Subject Classification ID

Related Items (1)

A decidable theory involving addition of differentiable real functions

Uses Software

• Isabelle/HOL
• RSOLVER
• IMPS
• Analytica
• Mathpert

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Decidability in elementary analysis. II
• Analytica --- an experiment in combining theorem proving and symbolic computation
• IMPS: An interactive mathematical proof system
• Decidability in elementary analysis. I
• On the Theoretical and Practical Complexity of the Existential Theory of Reals
• Decision algorithms for some fragments of analysis and related areas
• Efficient solving of quantified inequality constraints over the real numbers
• Verification: Theory and Practice
• Some undecidable problems involving elementary functions of a real variable

This page was built for publication: Decision algorithms for fragments of real analysis. I: Continuous functions with strict convexity and concavity predicates