On elementary logics for quantitative dependencies
From MaRDI portal
Publication:2172823
DOI10.1016/j.apal.2022.103104OpenAlexW4212817320WikidataQ114209357 ScholiaQ114209357MaRDI QIDQ2172823
Miika Hannula, Juha Kontinen, Minna Hirvonen
Publication date: 16 September 2022
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2104.04313
Other nonclassical logic (03B60) Logic in computer science (03B70) Complexity of computation (including implicit computational complexity) (03D15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A logical approach to context-specific independence
- Inclusion and exclusion dependencies in team semantics -- on some logics of imperfect information
- Metafinite model theory
- Probabilistic team semantics
- Approximation and dependence via multiteam semantics
- Dependence and independence
- Facets of distribution identities in probabilistic team semantics
- Logics for first-order team properties
- Erratum to: ``On definability in dependence logic
- A finite axiomatization of conditional independence and inclusion dependencies
- Axiomatizations of team logics
- Compositional semantics for a language of imperfect information
- Team semantics for the specification and verification of hyperproperties
- Descriptive complexity of real computation and probabilistic independence logic
- On Strongly First-Order Dependencies
- Finite Partially‐Ordered Quantifiers
- Finite partially-ordered quantification
- Tractability frontiers in probabilistic team semantics and existential second-order logic over the reals
This page was built for publication: On elementary logics for quantitative dependencies
