Quantum Computation and Information Seminar

Sessions

04/03/2005, 16:30 — 17:30 — Room P3.10, Mathematics Building
Amílcar Sernadas, Instituto Superior Técnico

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 by extending the Fagin-Halpern-Megiddo technique originally proposed in the context of probabilistic logic. Joint work with P. Mateus.

Joint session with <a href="http://sem.math.ist.utl.pt/clc/"> LCSeminar</a>. Please note the exceptional time and room.

Supported by: Phys-Info (IT), SQIG (IT), CeFEMA and CAMGSD, with funding from FCT, FEDER and EU FP7, specifically through the Doctoral Programme in the Physics and Mathematics of Information (DP-PMI), FCT strategic projects PEst-OE/EEI/LA0008/2013 and UID/EEA/50008/2013, IT project QuSim, project CRUP-CPU CQVibes, the FP7 Coordination Action QUTE-EUROPE (600788), and the FP7 projects Landauer (GA 318287) and PAPETS (323901).

7th Framework Programme