A solution of the uniform word problem for ortholattices
From MaRDI portal
Recommendations
Cites work
- Cut elimination and word problems for varieties of lattices
- From basic logic to quantum logics with cut-elimination
- scientific article; zbMATH DE number 3751028 (Why is no real title available?)
- Permutability of rules in lattice theory.
- Polynomial Time Uniform Word Problems
- Proof systems for lattice theory
- Proof theory for minimal quantum logic. I
- Proof theory for minimal quantum logic. II
- Semantic analysis of orthologic
- The logic of quantum mechanics
- The word and generator problems for lattices
Cited in
(10)- The word and generator problems for lattices
- Decision problem for orthomodular lattices
- On different proof-search strategies for orthologic
- Computer proof of monotonicity of operations on orthomodular lattices
- Automated discovery of single axioms for ortholattices
- The intensional side of algebraic-topological representation theorems
- On the Word Problem for Orthocomplemented Modular Lattices
- scientific article; zbMATH DE number 1145524 (Why is no real title available?)
- Equivalence checking for orthocomplemented bisemilattices in log-linear time
- Cut elimination and word problems for varieties of lattices
This page was built for publication: A solution of the uniform word problem for ortholattices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3583025)