Quantum computational logic with mixed states
arXiv:1002.5025
Abstract
Using an algebraic framework we solve a problem posed in [5] and [7] about the axiomatizability of a quantum computational type logic related to fuzzy logic. A Hilbert-style calculus is developed obtaining an algebraic strong completeness theorem.
submitted to the Mathematical Logic Quarterly