Pages that link to "Item:Q1956380"
From MaRDI portal
The following pages link to Coherence and computational complexity of quantifier-free dependence logic formulas (Q1956380):
Displayed 14 items.
- Upwards closed dependencies in team semantics (Q897651) (← links)
- Approximation and dependence via multiteam semantics (Q1783737) (← links)
- Expressivity of imperfect information logics without identity (Q1956377) (← links)
- Complexity of syntactical tree fragments of independence-friendly logic (Q2003922) (← links)
- A parameterized view on the complexity of dependence logic (Q2151403) (← links)
- Coherence in inquisitive first-order logic (Q2159932) (← links)
- Separation logic and logics with team semantics (Q2172820) (← links)
- Embedding causal team languages into predicate logic (Q2172831) (← links)
- Boolean dependence logic and partially-ordered connectives (Q2361349) (← links)
- (Q5013879) (← links)
- CHARACTERIZING DOWNWARDS CLOSED, STRONGLY FIRST-ORDER, RELATIVIZABLE DEPENDENCIES (Q5195061) (← links)
- Expressivity and Complexity of Dependence Logic (Q5213639) (← links)
- Complexity thresholds in inclusion logic (Q5925562) (← links)
- COMPLETE LOGICS FOR ELEMENTARY TEAM PROPERTIES (Q6103455) (← links)