Quantum computational logic with mixed states

From MaRDI portal



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.












This page was built for publication: Quantum computational logic with mixed states

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4915217)