Quantum logic is undecidable
DOI10.1007/s00153-020-00749-0zbMath1473.03039arXiv1607.05870OpenAlexW3098874102MaRDI QIDQ2663337
Publication date: 16 April 2021
Published in: Archive for Mathematical Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1607.05870
first-order theoryHilbert latticesorthomodular latticesdecidabilityquantum logicresidually finite-dimensionalquantum contextualityfinitely presented \(C^*\)-algebrarestricted word problem
Selfadjoint operator algebras ((C^*)-algebras, von Neumann ((W^*)-) algebras, etc.) (46L99) Decidability of theories and sets of sentences (03B25) Logical foundations of quantum mechanics; quantum logic (quantum-theoretic aspects) (81P10) Quantum logic (03G12) Contextuality in quantum theory (81P13)
Related Items (3)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Hilbert lattice equations
- Quantum logic in algebraic approach
- Decision problem for orthomodular lattices
- A combinatorial approach to nonlocality and contextuality
- The logic of quantum mechanics
- Can you compute the operator norm?
- Perfect commuting-operator strategies for linear system games
- Computational Complexity of Quantum Satisfiability
- On Characterizing the Standard Quantum Logics
- Characterization of hilbert spaces by orthomodular spaces
- Simple unified form for the major no-hidden-variables theorems
- The Undecidability of the Word Problems for Projective Geometries and Modular Lattices
- On the equational theory of projection lattices of finite von neumann factors
- Characterization of Binary Constraint System Games
- Tsirelson’s problem and an embedding theorem for groups arising from non-local games
- A remark on Piron's paper
- Generalized satisfiability problems via operator assignments
This page was built for publication: Quantum logic is undecidable
