Boolean algebra admits no convergent term rewriting system

4Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Although there exists a normal form for the theory of Boolean Algebra w.r.t, associativity and commutativity, the so called set of prime implicants, there does not exist a convergent equational term rewriting System for the theory of boolean algebra modulo AC. The result seems well-known, but no formal proof exists as yet. In this paper a formal proof of this fact is given.

Cite

CITATION STYLE

APA

Socher-Ambrosius, R. (1991). Boolean algebra admits no convergent term rewriting system. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 488 LNCS, pp. 264–274). Springer Verlag. https://doi.org/10.1007/3-540-53904-2_102

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free