Knuth–Bendix completion of theories of commuting group endomorphisms

• Published in: Information processing letters Vol. 98; no. 5; pp. 195 - 198
• Main Authors: Stump, Aaron, Löchner, Bernd
• Format: Journal Article
• Language: English
• Published: Amsterdam Elsevier B.V 15.06.2006; Elsevier Science; Elsevier Sequoia S.A
• Subjects: Algorithmics. Computability. Computer arithmetics; Applied sciences; Automatic theorem proving; Automation; Computer science; control theory; systems; Decision procedures; Exact sciences and technology; Group theory; Group theory and generalizations; Knuth–Bendix completion; Logic and foundations; Mathematical logic, foundations, set theory; Mathematical models; Mathematics; Proof theory and constructive mathematics; Sciences and techniques of general use; Studies; Theoretical computing; Theory; Knuth–Bendix completion; Decision procedures; Automatic theorem proving; Group theory; Knuth Bendix completion; Computer theory; Theorem proving; Ordering; Automatic proving; Verification; Knuth-Bendix completion; Equational theory

Knuth–Bendix completions of the equational theories of k ⩾ 2 commuting group endomorphisms are obtained, using automated theorem proving and modern termination checking. This improves on modern implementations of completion, where the orderings implemented cannot orient the commutation rules. The re...