• A
  • A
  • A
  • ABC
  • ABC
  • ABC
  • А
  • А
  • А
  • А
  • А
Regular version of the site

Book chapter

An Axiomatization of Quantum Computational Logic

P. 204-206.
According to [1;2;3] the axiomatizability of Quantun Computational Logic(QCL) is still an open problem.In the paper an axiomatization of QCL is proposed construing it as a kind of so-called binary logic. Some metalogical theorems (paraconsistency and completeness) are proved.