Quantum computational logic with mixed states
Quantum Physics
2013-07-30 v1
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.
Cite
@article{arxiv.1002.5025,
title = {Quantum computational logic with mixed states},
author = {Hector Freytes and Graciela Domenech},
journal= {arXiv preprint arXiv:1002.5025},
year = {2013}
}
Comments
submitted to the Mathematical Logic Quarterly