Quantum computational logic with mixed states
classification
🪐 quant-ph
keywords
logicalgebraiccomputationalquantumaxiomatizabilitycalculuscompletenessdeveloped
read the original 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 paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.