LIPIcs.CSL.2015.292.pdf
- Filesize: 0.57 MB
- 16 pages
Document
Axiomatizing Propositional Dependence Logics
Authors
-
Part of:
Volume:
24th EACSL Annual Conference on Computer Science Logic (CSL 2015)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: Computer Science Logic (CSL) - License:
Creative Commons Attribution 3.0 Unported license
- Publication date: 2015-09-07
Cite AsGet BibTex
Katsuhiko Sano and Jonni Virtema. Axiomatizing Propositional Dependence Logics. In 24th EACSL Annual Conference on Computer Science Logic (CSL 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 41, pp. 292-307, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2015)
https://doi.org/10.4230/LIPIcs.CSL.2015.292
https://doi.org/10.4230/LIPIcs.CSL.2015.292
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.
Keywords
- propositional dependence logic
- modal dependence logic
- axiomatization
- tableau calculus
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads