scientific article; zbMATH DE number 7362720
From MaRDI portal
Publication:4995356
zbMath1469.03086arXiv1406.6259MaRDI QIDQ4995356
Publication date: 24 June 2021
Full work available at URL: https://arxiv.org/abs/1406.6259
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Modal logic (including the logic of norms) (03B45) Other nonclassical logic (03B60) Logic in computer science (03B70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (7)
Propositional logics of dependence ⋮ Complexity of Propositional Independence and Inclusion Logic ⋮ The expressive power of modal logic with inclusion atoms ⋮ Unnamed Item ⋮ Propositional team logics ⋮ Characterising modal definability of team-based logics via the universal modality ⋮ Expressivity and Complexity of Dependence Logic
This page was built for publication:
