A class of mechanically decidable problems beyond Tarski's model

DOI10.1007/s11425-007-0090-8zbMath1133.68423OpenAlexW1975113638MaRDI QIDQ2475316

Lu Yang, Yong Yao, Yong Feng

Publication date: 11 March 2008

Published in: Science in China. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11425-007-0090-8

zbMATH Keywords

cell-decompositionmechanically decidable problemsymmetric polynomial inequalityTarski's modelTarski's sentence

Mathematics Subject Classification ID

Related Items (1)

Jensen type inequalities involving homogeneous polynomials

Uses Software

• Maple
• QEPCAD
• REDLOG
• DISCOVERER
• BOTTEMA

Cites Work

• A complete algorithm for automated discovering of a class of inequality-type theorems
• The parallel numerical method of mechanical theorem proving
• On the application of Buchberger's algorithm to automated geometry theorem proving
• Even symmetric sextics
• Partial cylindrical algebraic decomposition for quantifier elimination
• On the positivity of symmetric polynomial functions. I: General results
• On the positivity of symmetric polynomial functions. II: Lattice general results and positivity criteria for degrees 4 and 5
• Machine Proofs in Geometry
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A class of mechanically decidable problems beyond Tarski's model