Combining logical and algebraic techniques for natural style proving in elementary analysis
type: Item
instance of: scholarly article
title: Combining logical and algebraic techniques for natural style proving in elementary analysis
zbMATH Open document ID: 1183.68563
author: R. Vajda
author: Tudor Jebelean
author: Bruno Buchberger
published in: Mathematics and Computers in Simulation
publication date: 2009-06-18T00:00:00Z
Mathematics Subject Classification ID: 68T15
Mathematics Subject Classification ID: 03B35
Mathematics Subject Classification ID: 03C10
zbMATH DE Number: 5566433
zbMATH Keywords: automated theorem proving
zbMATH Keywords: extended quantifier elimination
zbMATH Keywords: CAD
zbMATH Keywords: Groebner bases
describes a project that uses: Mathematica
describes a project that uses: QEPCAD
describes a project that uses: REDLOG
describes a project that uses: Theorema
MaRDI profile type: Publication
full work available at URL: j.matcom.2008.11.002
OpenAlex ID: W2047275139
cites work: Q4391217
cites work: On using bi-equational constraints in CAD construction
cites work: The TH\(\exists\)OREM\(\forall\) project: A progress report
cites work: Q4391215
cites work: Q4247790
cites work: Q4459895
cites work: Q5648331
cites work: Applying Linear Quantifier Elimination
cites work: Model Theory
cites work: Q4949370
cites work: Hierarchical deduction
cites work: Quantifier elimination for real algebra -- the quadratic case and beyond
cites work: Polynomial algorithms in computer algebra
cites work: Q4244407
DOI: 10.1016/J.MATCOM.2008.11.002
description: scientific article; zbMATH DE number 5566433