Any ground associative-commutative theory has a finite canonical system
- 1 January 1991
- book chapter
- Published by Springer Nature
- Vol. 17 (1) , 423-434
- https://doi.org/10.1007/3-540-53904-2_115
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Finding canonical rewriting systems equivalent to a finite set of ground equations in polynomial timePublished by Springer Nature ,2005
- Automated proofs of the moufang identities in alternative ringsJournal of Automated Reasoning, 1990
- Rewrite SystemsPublished by Elsevier ,1990
- Termination of rewriting systems by polynomial interpretations and its implementationScience of Computer Programming, 1987
- Termination of rewritingJournal of Symbolic Computation, 1987
- A new method for establishing refutational completeness in theorem provingPublished by Springer Nature ,1986
- Commutation, transformation, and terminationPublished by Springer Nature ,1986
- Termination orderings for associative-commutative rewriting systemsJournal of Symbolic Computation, 1985
- New decision algorithms for finitely presented commutative semigroupsComputers & Mathematics with Applications, 1981
- Finiteness of the Odd Perfect and Primitive Abundant Numbers with n Distinct Prime FactorsAmerican Journal of Mathematics, 1913