Pages that link to "Item:Q4608724"
From MaRDI portal
The following pages link to Complexity of Propositional Logics in Team Semantic (Q4608724):
Displaying 21 items.
- Propositional team logics (Q526967) (← links)
- A parameterized view on the complexity of dependence logic (Q2151403) (← links)
- Enumerating teams in first-order team logics (Q2172832) (← links)
- On the complexity of linear temporal logic with team semantics (Q2193280) (← links)
- On the computational consequences of independence in propositional logic (Q2500830) (← 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)
- Tractability Frontier of Data Complexity in Team Semantics (Q5056358) (← links)
- Canonical Models and the Complexity of Modal Team Logic (Q5079755) (← links)
- Model Checking and Validity in Propositional and Modal Inclusion Logics (Q5111246) (← links)
- Polyteam semantics (Q5140328) (← links)
- Model checking and validity in propositional and modal inclusion logics (Q5213388) (← links)
- (Q5232899) (← links)
- (Q5376653) (← links)
- (Q5376655) (← links)
- On Composing Finite Forests with Modal Logics (Q5886519) (← links)
- Parameterised complexity of model checking and satisfiability in propositional dependence logic (Q5918486) (← links)
- Complexity thresholds in inclusion logic (Q5925562) (← links)
- COMPLETE LOGICS FOR ELEMENTARY TEAM PROPERTIES (Q6103455) (← links)
- Logics with probabilistic team semantics and the Boolean negation (Q6545573) (← links)
- Parameterized complexity of weighted team definability (Q6620025) (← links)