Pages that link to "Item:Q515658"
From MaRDI portal
The following pages link to Complexity of validity for propositional dependence logics (Q515658):
Displaying 13 items.
- Complexity of validity for propositional dependence logics (Q515658) (← links)
- A parameterized view on the complexity of dependence logic (Q2151403) (← links)
- Characterising modal definability of team-based logics via the universal modality (Q2273015) (← links)
- Boolean dependence logic and partially-ordered connectives (Q2361349) (← links)
- A fragment of dependence logic capturing polynomial time (Q2878749) (← links)
- Complexity Results for Modal Dependence Logic (Q3586056) (← links)
- Team semantics for the specification and verification of hyperproperties (Q5005106) (← links)
- Expressivity and Complexity of Dependence Logic (Q5213639) (← links)
- (Q5232899) (← links)
- (Q5376655) (← links)
- Computer Science Logic (Q5394588) (← links)
- Parameterised complexity of model checking and satisfiability in propositional dependence logic (Q5918486) (← links)
- Complexity thresholds in inclusion logic (Q5925562) (← links)
