Proof of the weak completeness of EQPL
After a brief review of the language and semantics of EQPL (exogenous quantum propositional logic), a weak complete axiomatization is presented. The proof of completeness is achieved extending the Fagin-Halpern-Megiddo technique originally proposed in the context of probabilistic logic. Joint work with P. Mateus.
Areas of interest
Logic and Computation
Amílcar Sernadas (IST, Lisboa)
March 15, 2005