On the complexity of equational decision problems for finite height complemented and orthocomplemented modular lattices

Abstract

We study the computational complexity of the satisfiability problem and the complement of the equivalence problem for complemented (orthocomplemented) modular lattices L and classes thereof. Concerning a simple L of finite height, $$\mathcal {NP}$$ NP -hardness is shown for both problems. Moreover, both problems are shown to be polynomial-time equivalent to the same feasibility problem over the division ring D whenever L is the subspace lattice of a D-vector space of finite dimension at least 3. Considering the class of all finite dimensional Hilbert spaces, the equivalence problem for the class of subspace ortholattices is shown to be polynomial-time equivalent to that for the class of endomorphism $$*$$ ∗ -rings with pseudo-inversion; moreover, we derive completeness for the complement of the Boolean part of the nondeterministic Blum-Shub-Smale model of real computation without constants. This result extends to the additive category of finite dimensional Hilbert spaces, enriched by adjunction and pseudo-inversion.