Pages that link to "Item:Q5213639"
From MaRDI portal
The following pages link to Expressivity and Complexity of Dependence Logic (Q5213639):
Displaying 18 items.
- Dependence of variables construed as an atomic formula (Q636322) (← links)
- On definability in dependence logic (Q735407) (← links)
- Safe dependency atoms and possibility operators in team semantics (Q2029599) (← 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)
- (Q3384878) (← links)
- Complexity Results for Modal Dependence Logic (Q3586056) (← links)
- (Q3742766) (← links)
- Characterizing quantifier extensions of dependence logic (Q4916562) (← links)
- Team semantics for the specification and verification of hyperproperties (Q5005106) (← links)
- On the complexity of team logic and its two-variable fragment (Q5005127) (← links)
- (Q5015279) (← links)
- Canonical Models and the Complexity of Modal Team Logic (Q5079755) (← links)
- Model Checking and Validity in Propositional and Modal Inclusion Logics (Q5111246) (← links)
- CHARACTERIZING DOWNWARDS CLOSED, STRONGLY FIRST-ORDER, RELATIVIZABLE DEPENDENCIES (Q5195061) (← links)
- A dependent dependency calculus (Q6166797) (← links)