Equational methods in first order predicate calculus
- 1 March 1985
- journal article
- Published by Elsevier in Journal of Symbolic Computation
- Vol. 1 (1) , 7-29
- https://doi.org/10.1016/s0747-7171(85)80026-2
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- A complete proof of correctness of the Knuth-Bendix completion algorithmJournal of Computer and System Sciences, 1981
- Complete Sets of Reductions for Some Equational TheoriesJournal of the ACM, 1981
- Automated Theorem-Proving for Theories with Simplifiers Commutativity, and AssociativityJournal of the ACM, 1974
- A Machine-Oriented Logic Based on the Resolution PrincipleJournal of the ACM, 1965
- A Remark on Functionally Free AlgebrasAnnals of Mathematics, 1946
- On the Structure of Abstract AlgebrasMathematical Proceedings of the Cambridge Philosophical Society, 1935