scientific article; zbMATH DE number 7439740
From MaRDI portal
Publication:5015279
zbMath1478.03066arXiv1609.04097MaRDI QIDQ5015279
Martin Lück, Juha Kontinen, Miika Hannula, Jonni Virtema
Publication date: 7 December 2021
Full work available at URL: https://arxiv.org/abs/1609.04097
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Logic in computer science (03B70) Complexity of computation (including implicit computational complexity) (03D15)
Related Items (7)
Axiomatizations of team logics ⋮ Embedding causal team languages into predicate logic ⋮ Unnamed Item ⋮ Parameterized complexity of propositional inclusion and independence logic ⋮ On the complexity of the quantified bit-vector arithmetic with binary encoding ⋮ On the complexity of team logic and its two-variable fragment ⋮ Canonical Models and the Complexity of Modal Team Logic
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A double team semantics for generalized quantifiers
- Model-checking hierarchical structures
- Inclusion and exclusion dependencies in team semantics -- on some logics of imperfect information
- Complexity of Propositional Independence and Inclusion Logic
- Modal Inclusion Logic: Being Lax is Simpler than Being Strict
- Hierarchies in independence logic
- Alternation
- Expressivity and Complexity of Dependence Logic
- Axiomatizations for Propositional and Modal Team Logic
- Team Logic and Second-Order Logic
- Lower bounds for multiplayer noncooperative games of incomplete information
This page was built for publication:
