Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
426712 | Information and Computation | 2006 | 24 Pages |
Abstract
A finitary axiomatization for EQPL (exogenous quantum propositional logic) is presented. The axiomatization is shown to be weakly complete relative to an oracle for analytical reasoning. The proof is carried out using a non-trivial extension of the Fagin–Halpern–Megiddo technique together with three Henkin style completions.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics