A Technique for Establishing Completeness Results in Theorem Proving with Equality
- 1 February 1983
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 12 (1) , 82-100
- https://doi.org/10.1137/0212006
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- Complete Sets of Reductions for Some Equational TheoriesJournal of the ACM, 1981
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting SystemsJournal of the ACM, 1980
- Proving termination with multiset orderingsCommunications of the ACM, 1979
- A short survey on the state of the art in matching and unification problemsACM SIGSAM Bulletin, 1979
- Proving Theorems with the Modification MethodSIAM Journal on Computing, 1975
- A Human Oriented Logic for Automatic Theorem-ProvingJournal of the ACM, 1974
- Tree-Manipulating Systems and Church-Rosser TheoremsJournal of the ACM, 1973
- Automatic Theorem Proving with Built-in Theories Including Equality, Partial Ordering, and SetsJournal of the ACM, 1972
- Simple Word Problems in Universal Algebras††The work reported in this paper was supported in part by the U.S. Office of Naval Research.Published by Elsevier ,1970
- Semi-Automated MathematicsJournal of the ACM, 1969