Please use this identifier to cite or link to this item:
doi:10.22028/D291-40257 | Title: | Boolean Algebra Admits No Convergent Term Rewriting System |
| Author(s): | Socher-Ambrosius, Rolf |
| Language: | English |
| Year of Publication: | 1990 |
| Place of publication: | Kaiserslautern |
| Free key words: | Boolean Algebra Term Rewriting Automated Theorem Proving |
| DDC notations: | 004 Computer science, internet |
| Publikation type: | Report |
| Abstract: | Although there exists a normal form for boolean algebra terms, the so called set of prime implicants, there does not exist a convergent term rewriting system for the theory of boolean algebra. The result seems well-known, but no formal proof exists as yet. In this paper a formal proof of this fact is given. |
| Link to this record: | urn:nbn:de:bsz:291--ds-402577 hdl:20.500.11880/37665 http://dx.doi.org/10.22028/D291-40257 |
| Series name: | SEKI-Report / Deutsches Forschungszentrum für Künstliche Intelligenz, DFKI [ISSN 1437-4447] |
| Series volume: | 90,6 |
| Date of registration: | 17-May-2024 |
| Faculty: | SE - Sonstige Einrichtungen |
| Department: | SE - DFKI Deutsches Forschungszentrum für Künstliche Intelligenz |
| Professorship: | SE - Sonstige |
| Collections: | SciDok - Der Wissenschaftsserver der Universität des Saarlandes |
Files for this record:
| File | Description | Size | Format | |
|---|---|---|---|---|
| SEKI-Report-SR-90-06_Socher=Ambrosius_Boolean-Algebra-Admits-No-Convergent-Term-Rewriting-System.pdf | 2,91 MB | Adobe PDF | View/Open |
Items in SciDok are protected by copyright, with all rights reserved, unless otherwise indicated.