Quantum logic is undecidable.

We investigate the first-order theory of closed subspaces of complex Hilbert spaces in the signature (∨ , ⊥ , 0 , 1) , where ' ⊥ ' is the orthogonality relation. Our main result is that already its quasi-identities are undecidable: there is no algorithm to decide whether an implication between equations and orthogonality relations implies another equation. This is a corollary of a recent result of Slofstra in combinatorial group theory. It follows upon reinterpreting that result in terms of the hypergraph approach to quantum contextuality, for which it constitutes a proof of the inverse sandwich conjecture. It can also be interpreted as stating that a certain quantum satisfiability problem is undecidable. [ABSTRACT FROM AUTHOR]