Model Checking for Modal Intuitionistic Dependence Logic

DOI10.1007/978-3-642-36976-6_15zbMath1385.68015OpenAlexW15639825MaRDI QIDQ4914522

Peter Lohmann, Fan Yang, Johannes Ebbing

Publication date: 12 April 2013

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

Full work available at URL: https://doi.org/10.1007/978-3-642-36976-6_15

zbMATH Keywords

computational complexitymodal logicmodel checkingintuitionistic logicdependence logic

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Specification and verification (program logics, model checking, etc.) (68Q60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (5)

Propositional logics of dependence ⋮ Complexity of Model Checking for Modal Dependence Logic ⋮ Complexity of validity for propositional dependence logics ⋮ Propositional team logics ⋮ Characterising modal definability of team-based logics via the universal modality

This page was built for publication: Model Checking for Modal Intuitionistic Dependence Logic