Boolean dependence logic and partially-ordered connectives
From MaRDI portal
Publication:2361349
DOI10.1016/j.jcss.2017.03.009zbMath1423.03109OpenAlexW2605109315WikidataQ126194763 ScholiaQ126194763MaRDI QIDQ2361349
Johannes Ebbing, Jonni Virtema, Peter Lohmann, Lauri Hella
Publication date: 30 June 2017
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://trepo.tuni.fi/handle/10024/117024
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A double team semantics for generalized quantifiers
- Axiomatizing first-order consequences in dependence logic
- Complexity of two-variable dependence logic and IF-logic
- Complexity of validity for propositional dependence logics
- Dependence of variables construed as an atomic formula
- Inclusion and exclusion dependencies in team semantics -- on some logics of imperfect information
- From IF to BI. A tale of dependence and separation
- Partially ordered connectives and monadic monotone strict NP
- Henkin quantifiers and complete problems
- Dependence and independence
- Complexity results for modal dependence logic
- Coherence and computational complexity of quantifier-free dependence logic formulas
- Boolean Dependence Logic and Partially-Ordered Connectives
- Extended Modal Dependence Logic $\mathcal{EMDL}$
- Dependence Logic with Generalized Quantifiers: Axiomatizations
- A Fragment of Dependence Logic Capturing Polynomial Time
- Complexity of Model Checking for Modal Dependence Logic
- Hierarchies in Dependence Logic
- Model-theoretic and Computational Properties of Modal Dependence Logic
- PARTIALLY ORDERED CONNECTIVES
- The Expressive Power of Modal Dependence Logic
- Characterizing quantifier extensions of dependence logic
- Monotone monadic SNP and constraint satisfaction
- Computer Science Logic
- Finite Partially‐Ordered Quantifiers
- Applications of Strict Π11 predicates to infinitary logic
- Finite partially-ordered quantification
- Logical Approaches to Computational Barriers
This page was built for publication: Boolean dependence logic and partially-ordered connectives
