Pages that link to "Item:Q3656769"
From MaRDI portal
The following pages link to Model-theoretic and Computational Properties of Modal Dependence Logic (Q3656769):
Displaying 23 items.
- Dependence logic with a majority quantifier (Q302214) (← links)
- Complexity of two-variable dependence logic and IF-logic (Q476186) (← links)
- Transition semantics: the dynamics of dependence logic (Q484952) (← links)
- Complexity of validity for propositional dependence logics (Q515658) (← links)
- Propositional team logics (Q526967) (← links)
- Epistemic operators in dependence logic (Q1956375) (← links)
- Complexity results for modal dependence logic (Q1956378) (← links)
- Characterising modal definability of team-based logics via the universal modality (Q2273015) (← links)
- Boolean dependence logic and partially-ordered connectives (Q2361349) (← links)
- Complexity of Model Checking for Modal Dependence Logic (Q2891371) (← links)
- Modal Inclusion Logic: Being Lax is Simpler than Being Strict (Q2946343) (← links)
- Modal independence logic: (Q3133166) (← links)
- Linear Programming Tools for Analyzing Strategic Games of Independence-Friendly Logic and Applications (Q3299589) (← links)
- Inf-datalog, Modal Logic and Complexities (Q3549285) (← links)
- Complexity Results for Modal Dependence Logic (Q3586056) (← links)
- (Q3693507) (← links)
- The expressive power of modal logic with inclusion atoms (Q5013883) (← links)
- Canonical Models and the Complexity of Modal Team Logic (Q5079755) (← links)
- Modal dependence logics: axiomatizations and model-theoretic properties (Q5095630) (← links)
- Expressivity and Complexity of Dependence Logic (Q5213639) (← links)
- Axiomatizing Propositional Dependence Logics (Q5351964) (← links)
- (Q5376655) (← links)
- Intermediate logics in the setting of team semantics (Q6612815) (← links)
