scientific article; zbMATH DE number 7056228
From MaRDI portal
Publication:5376655
Publication date: 17 May 2019
Full work available at URL: https://arxiv.org/abs/1608.04301
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
complexitymodal logicpropositional logicvalidityentailmentdependence logicindependence logicinclusion logic
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Propositional logics of dependence
- Complexity of validity for propositional dependence logics
- Inclusion and exclusion dependencies in team semantics -- on some logics of imperfect information
- Complexity results for modal dependence logic
- Extended Modal Dependence Logic $\mathcal{EMDL}$
- Model Checking for Modal Dependence Logic: An Approach through Post’s Lattice
- Complexity of Model Checking for Modal Dependence Logic
- Complexity of Propositional Independence and Inclusion Logic
- Modal Inclusion Logic: Being Lax is Simpler than Being Strict
- Hierarchies in independence logic
- Model-theoretic and Computational Properties of Modal Dependence Logic
- Alternation
- The Computational Complexity of Provability in Systems of Modal Propositional Logic
- Compositional semantics for a language of imperfect information
- Complexity of Propositional Logics in Team Semantic
- The Expressive Power of Modal Dependence Logic
- The expressive power of modal logic with inclusion atoms
- Modal dependence logics: axiomatizations and model-theoretic properties
- Model Checking and Validity in Propositional and Modal Inclusion Logics
- Axiomatizing Propositional Dependence Logics
- The complexity of theorem-proving procedures
- Lower bounds for multiplayer noncooperative games of incomplete information
This page was built for publication:
