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.
@InProceedings{sano_et_al:LIPIcs.CSL.2015.292, author = {Sano, Katsuhiko and Virtema, Jonni}, title = {{Axiomatizing Propositional Dependence Logics}}, booktitle = {24th EACSL Annual Conference on Computer Science Logic (CSL 2015)}, pages = {292--307}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-90-3}, ISSN = {1868-8969}, year = {2015}, volume = {41}, editor = {Kreutzer, Stephan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2015.292}, URN = {urn:nbn:de:0030-drops-54215}, doi = {10.4230/LIPIcs.CSL.2015.292}, annote = {Keywords: propositional dependence logic, modal dependence logic, axiomatization, tableau calculus} }
Feedback for Dagstuhl Publishing