A Terminating and Confluent Term Rewriting System for the Pure Equational Theory of Quandles
Robert W. McGrail, Thuy Trang Nguyen, Thanh Thuy Trang Tran, Arti Tripathi
Abstract
Robert W. McGrail, Thuy Trang Nguyen, Thanh Thuy Trang Tran, Arti Tripathi
Abstract
This article presents a term rewriting system for the first-order equational theory of quandles that is both terminating and confluent. As a consequence, it has unique normal forms and so encodes a decision procedure for quandle identities. However, the problem of computing a normal form for this term rewriting system is, in worst case, EXP hard.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
This article presents a term rewriting system for the first-order equational theory of quandles that is both terminating and confluent. As a consequence, it has unique normal forms and so encodes a decision procedure for quandle identities. However, the problem of computing a normal form for this term rewriting system is, in worst case, EXP hard.
Key concepts: Rewriting, Normalization property, Term (time), Confluence, Order (exchange), Computer science, Equational logic, Mathematics