scientific article; zbMATH DE number 7104925
From MaRDI portal
Publication:5232899
Publication date: 13 September 2019
Full work available at URL: https://arxiv.org/abs/1903.02344
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)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Propositional logics of dependence
- On the succinctness of some modal logics
- Complexity of validity for propositional dependence logics
- Propositional team logics
- Inclusion and exclusion dependencies in team semantics -- on some logics of imperfect information
- Upwards closed dependencies in team semantics
- Dependence and independence
- First-order logic with two variables and unary temporal logic
- Extended Modal Dependence Logic $\mathcal{EMDL}$
- On the Relative Succinctness of Two Extensions by Definitions of Multimodal Logic
- Modal independence logic:
- Alternation
- Compositional semantics for a language of imperfect information
- Complexity of Propositional Logics in Team Semantic
- The Succinctness of First-order Logic over Modal Logic via a Formula Size Game
- The Expressive Power of Modal Dependence Logic
- Team semantics for the specification and verification of hyperproperties
- The expressive power of modal logic with inclusion atoms
- Canonical Models and the Complexity of Modal Team Logic
- The Size of a Formula as a Measure of Complexity
- An n ! lower bound on formula size
- The succinctness of first-order logic on linear orders
- A Van Benthem Theorem for Modal Team Semantics
- Team Logic and Second-Order Logic
This page was built for publication:
