Model-theoretic and Computational Properties of Modal Dependence Logic

DOI10.1093/logcom/exn102zbMath1193.03042OpenAlexW2156038678MaRDI QIDQ3656769

Merlijn Sevenster

Publication date: 14 January 2010

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/logcom/exn102

zbMATH Keywords

modal logicmodel theoryfunctional dependencecomplexity theorydependence operator

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45)

Related Items (15)

Boolean dependence logic and partially-ordered connectives ⋮ Complexity of Model Checking for Modal Dependence Logic ⋮ Dependence logic with a majority quantifier ⋮ Modal Inclusion Logic: Being Lax is Simpler than Being Strict ⋮ The expressive power of modal logic with inclusion atoms ⋮ Complexity results for modal dependence logic ⋮ Complexity of two-variable dependence logic and IF-logic ⋮ Transition semantics: the dynamics of dependence logic ⋮ Linear Programming Tools for Analyzing Strategic Games of Independence-Friendly Logic and Applications ⋮ Complexity of validity for propositional dependence logics ⋮ Propositional team logics ⋮ Characterising modal definability of team-based logics via the universal modality ⋮ Expressivity and Complexity of Dependence Logic ⋮ Canonical Models and the Complexity of Modal Team Logic ⋮ Unnamed Item

This page was built for publication: Model-theoretic and Computational Properties of Modal Dependence Logic