Abstract
It has been known for some time but does not seem to be anywhere in the literature that the variety of all ortholattices is generated by its finite members (see (4.2) of this paper). This is well known to imply that the word problem for free ortholattices is solvable. On the other hand, it is also known that the solution obtained this way is of no practical use. The main purpose of this paper is to present a workable solution.
Publisher
Canadian Mathematical Society
Cited by
27 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Orthologic with Axioms;Proceedings of the ACM on Programming Languages;2024-01-05
2. Interpolation and Quantifiers in Ortholattices;Lecture Notes in Computer Science;2023-12-30
3. Formula Normalizations in Verification;Computer Aided Verification;2023
4. Equivalence Checking for Orthocomplemented Bisemilattices in Log-Linear Time;Tools and Algorithms for the Construction and Analysis of Systems;2022
5. Logical Aspects of Quantum Structures;Studies in Systems, Decision and Control;2022