Validity and entailment in modal and propositional dependence logics

Show full item record



Permalink

http://hdl.handle.net/10138/303495

Citation

Hannula , M 2019 , ' Validity and entailment in modal and propositional dependence logics ' , Logical Methods in Computer Science , vol. 15 , no. 2 , 24 , pp. 4:1–4:24 . https://doi.org/10.23638/LMCS-15(2:4)2019

Title: Validity and entailment in modal and propositional dependence logics
Author: Hannula, Miika
Contributor: University of Helsinki, Department of Mathematics and Statistics
Date: 2019-04-26
Language: eng
Number of pages: 24
Belongs to series: Logical Methods in Computer Science
ISSN: 1860-5974
URI: http://hdl.handle.net/10138/303495
Abstract: The computational properties of modal and propositional dependence logics have been extensively studied over the past few years, starting from a result by Sevenster showing NEXPTIME-completeness of the satisfiability problem for modal dependence logic. Thus far, however, the validity and entailment properties of these logics have remained mostly unaddressed. This paper provides a comprehensive classification of the complexity of validity and entailment in various modal and propositional dependence logics. The logics examined are obtained by extending the standard modal and propositional logics with notions of dependence, independence, and inclusion in the team semantics context. In particular, we address the question of the complexity of validity in modal dependence logic. By showing that it is NEXPTIME-complete we refute an earlier conjecture proposing a higher complexity for the problem.
Subject: dependence logic
inclusion logic
independenc logic
modal logic
propositional logic
complexity
validity
entailment
COMPLEXITY
INCLUSION
113 Computer and information sciences
Rights:


Files in this item

Total number of downloads: Loading...

Files Size Format View
1608.04301.pdf 495.6Kb PDF View/Open

This item appears in the following Collection(s)

Show full item record