Proof of the weak completeness of EQPL
 
 
Description:  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.
Area(s): Logic and Computation
Date:  2005-03-15
Start Time:   14.30
Speaker:  Amílcar Sernadas (IST, Lisboa)
Place:  5.5
Research Groups: -Algebra, Logic and Topology
See more:   <Main>  
 
© Centre for Mathematics, University of Coimbra, funded by
Science and Technology Foundation
Powered by: rdOnWeb v1.4 | technical support