Approximation and dependence via multiteam semantics
DOI10.1007/978-3-319-30024-5_15zbMATH Open1459.03031DBLPconf/foiks/0001HKMV16arXiv1510.09040OpenAlexW2962881322WikidataQ57998265 ScholiaQ57998265MaRDI QIDQ2807084FDOQ2807084
Authors: Arnaud Durand, Miika Hannula, Juha Kontinen, Arne Meier, Jonni Virtema
Publication date: 19 May 2016
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1510.09040
Recommendations
Other nonclassical logic (03B60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Logic in computer science (03B70)
Cited In (10)
- SOME OBSERVATIONS ABOUT GENERALIZED QUANTIFIERS IN LOGICS OF IMPERFECT INFORMATION
- Title not available (Why is that?)
- Team semantics for interventionist counterfactuals: observations vs. interventions
- Upwards closed dependencies in team semantics
- A logical approach to context-specific independence
- A Logical Approach to Context-Specific Independence
- Multiteam semantics for interventionist counterfactuals: probabilities and causation
- Embedding causal team languages into predicate logic
- Formalizing statistical causality via modal logic
- Team semantics for the specification and verification of hyperproperties
This page was built for publication: Approximation and dependence via multiteam semantics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2807084)