Completeness results for inequality provers
From MaRDI portal
Publication:1079960
DOI10.1016/0004-3702(85)90015-3zbMath0598.68059OpenAlexW2058156127MaRDI QIDQ1079960
Publication date: 1985
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0004-3702(85)90015-3
resolutioncompleteness theoremautomated deductionfactoringelementary calculusordering of the real numbersproofs of propositions about dense total orders without endpointsrule of chainingself-chaining
Total orders (06A05) Software, source code, etc. for problems pertaining to ordered structures (06-04)
Related Items (4)
Completeness results for inequality provers ⋮ Theorem proving in cancellative abelian monoids (extended abstract) ⋮ The problem of reasoning from inequalities ⋮ Ordered chaining for total orderings
Cites Work
This page was built for publication: Completeness results for inequality provers