Pages that link to "Item:Q5145662"
From MaRDI portal
The following pages link to Descriptive complexity of real computation and probabilistic independence logic (Q5145662):
Displaying 9 items.
- On the relation between descriptional complexity and algorithmic probability (Q1057064) (← links)
- A parameterized view on the complexity of dependence logic (Q2151403) (← links)
- Unifying hidden-variable problems from quantum mechanics by logics of dependence and independence (Q2172822) (← links)
- On elementary logics for quantitative dependencies (Q2172823) (← links)
- Tractability frontiers in probabilistic team semantics and existential second-order logic over the reals (Q5918401) (← links)
- Tractability frontiers in probabilistic team semantics and existential second-order logic over the reals (Q5918795) (← links)
- Logics with probabilistic team semantics and the Boolean negation (Q6545573) (← links)
- Parameterized complexity of weighted team definability (Q6620025) (← links)
- Temporal team semantics revisited (Q6649479) (← links)