On the complexity of team logic and its two-variable fragment
From MaRDI portal
Publication:5005127
DOI10.4230/LIPIcs.MFCS.2018.27OpenAlexW2964260039MaRDI QIDQ5005127
Publication date: 4 August 2021
Full work available at URL: https://arxiv.org/abs/1804.04968
Related Items (4)
Doubly strongly first order dependencies ⋮ Unnamed Item ⋮ Safe dependency atoms and possibility operators in team semantics ⋮ Canonical Models and the Complexity of Modal Team Logic
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A double team semantics for generalized quantifiers
- Model-checking games for logics of imperfect information
- Finite satisfiability for guarded fixpoint logic
- Complexity of two-variable dependence logic and IF-logic
- Propositional team logics
- Inclusion and exclusion dependencies in team semantics -- on some logics of imperfect information
- Finite model theory and its applications.
- Upwards closed dependencies in team semantics
- The complexity of logical theories
- Modal languages and bounded fragments of predicate logic
- General models and entailment semantics for independence logic
- Dependence and independence
- Axiomatizations of team logics
- Dependence Logic
- Extended Modal Dependence Logic $\mathcal{EMDL}$
- Alternation
- On languages with two variables
- On the Decision Problem for Two-Variable First-Order Logic
- Compositional semantics for a language of imperfect information
- Decidability of predicate logics with team semantics
- Complexity of Propositional Logics in Team Semantic
- Deciding First-Order Satisfiability when Universal and Existential Variables are Separated
- The Two-Variable Fragment with Counting Revisited
- Expressivity and Complexity of Dependence Logic
- On Strongly First-Order Dependencies
- Team Logic and Second-Order Logic
This page was built for publication: On the complexity of team logic and its two-variable fragment
