Axiomatizing Propositional Dependence Logics
Logic in Computer Science
2014-10-21 v1 Logic
Abstract
We give sound and complete Hilbert-style axiomatizations for propositional dependence logic (PD), modal dependence logic (MDL), and extended modal dependence logic (EMDL) by extending existing axiomatizations for propositional logic and modal logic. In addition, we give novel labeled tableau calculi for PD, MDL, and EMDL. We prove soundness, completeness and termination for each of the labeled calculi.
Cite
@article{arxiv.1410.5038,
title = {Axiomatizing Propositional Dependence Logics},
author = {Katsuhiko Sano and Jonni Virtema},
journal= {arXiv preprint arXiv:1410.5038},
year = {2014}
}
Comments
15 pages