On the complexity of equational decision problems for finite height complemented and orthocomplemented modular lattices
DOI10.1007/s00012-021-00760-3OpenAlexW4206759152MaRDI QIDQ2073367
Publication date: 2 February 2022
Published in: Algebra Universalis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00012-021-00760-3
complexitysatisfiability problemscomplemented modular latticeHilbert categorymatrix \(*\)-ringortholattice of subspaces
Category-theoretic methods and results in associative algebras (except as in 16D90) (16B50) Logical foundations of quantum mechanics; quantum logic (quantum-theoretic aspects) (81P10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complemented modular lattices, continuous geometries (06C20)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Decidability of the equational theory of the continuous geometry \(\mathrm{CG}(\mathbb F)\)
- Zum Wortproblem für freie Untermodulverbände
- A test for identities satisfied in lattices of submodules
- Computers and universal algebra: Some directions
- Definable relations in finite-dimensional subspace lattices with involution
- Rings of quotients of finite \(AW^{\ast}\)-algebras: representation and algebraic approximation
- The equational theory of a nontrivial discriminator variety is co-NP-hard
- Any orthocomplemented complete modular lattice is a continuous geometry
- Categorical quantum mechanics
- Finite dimensional Hilbert spaces are complete for dagger compact closed categories
- On the consistency problem for modular lattices and related structures
- Linear representations of regular rings and complemented modular lattices with involution
- Projective Geometries as Projective Modular Lattices
- Computational Complexity of Quantum Satisfiability
- An embedding theorem for Hilbert categories
- On the Computational Complexity of Algebra on Lattices
- Free Modular Lattices
- Witnessing matrix identities and proof complexity
- The Undecidability of the Word Problems for Projective Geometries and Modular Lattices
- On the equational theory of projection lattices of finite von neumann factors
- Polarities in finite projective planes
This page was built for publication: On the complexity of equational decision problems for finite height complemented and orthocomplemented modular lattices
