Seminário de Computação e Informação Quântica

Sessões

04/03/2005, 16:30 — 17:30 — Sala P3.10, Pavilhão de Matemática
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.

Apoiado por: Phys-Info (IT), SQIG (IT), CeFEMA e CAMGSD, com financiamento de FCT, FEDER and EU FP7, especificamente via o Doctoral Programme in the Physics and Mathematics of Information (DP-PMI), os projectos estratégicos FCT PEst-OE/EEI/LA0008/2013 e UID/EEA/50008/2013, o projecto IT QuSim, o projecto CRUP-CPU CQVibes, a Acção de Coordenação FP7 QUTE-EUROPE (600788) e os projectos FP7 Landauer (GA 318287) e PAPETS (323901).

7th Framework Programme