On elementary logics for quantitative dependencies

DOI10.1016/J.APAL.2022.103104MaRDI QIDQ2172823zbMATH OpenOpenAlexWikidataFDO

Authors Miika Hannula, Minna Hirvonen, Juha Kontinen

Publication date 16 September 2022

Published in Annals of Pure and Applied Logic (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/2104.04313

zbMATH Keywords

conditional independencedependence logicmetafinite structuresprobabilistic team semantics

Mathematics Subject Classification ID

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)

Recommendations

• Logics with multiteam semantics
• Probabilistic team semantics
• Logics with probabilistic team semantics and the Boolean negation
• Approximation and dependence via multiteam semantics
• Facets of distribution identities in probabilistic team semantics

Cites work

• A finite axiomatization of conditional independence and inclusion dependencies
• A logical approach to context-specific independence
• Approximation and dependence via multiteam semantics
• Axiomatizations of team logics
• Compositional semantics for a language of imperfect information
• Dependence and independence
• Dependence logic. A new approach to independence friendly logic
• Descriptive complexity of real computation and probabilistic independence logic
• Erratum to: ``On definability in dependence logic
• Facets of distribution identities in probabilistic team semantics
• Finite partially-ordered quantification
• Finite Partially‐Ordered Quantifiers
• scientific article; zbMATH DE number 1263207 (Why is no real title available?)
• scientific article; zbMATH DE number 3196255 (Why is no real title available?)
• Inclusion and exclusion dependencies in team semantics -- on some logics of imperfect information
• Logics for first-order team properties
• Metafinite model theory
• On strongly first-order dependencies
• Probabilistic team semantics
• Team semantics for the specification and verification of hyperproperties
• Tractability frontier of data complexity in team semantics
• Tractability frontiers in probabilistic team semantics and existential second-order logic over the reals

Cited in

(4)

• Characterizing quantifier extensions of dependence logic
• Foundations for entailment checking in quantitative separation logic
• Logics with probabilistic team semantics and the Boolean negation
• Logics with probabilistic team semantics and the Boolean negation

This page was built for publication: On elementary logics for quantitative dependencies

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2172823)