Propositional Team Logics
arXiv:1606.03984 · doi:10.1016/j.apal.2017.01.007
Abstract
We consider team semantics for propositional logic, continuing our previous work (Yang & Väänänen 2016). In team semantics the truth of a propositional formula is considered in a set of valuations, called a team, rather than in an individual valuation. This offers the possibility to give meaning to concepts such as dependence, independence and inclusion. We define an expressively maximal propositional team logic, called full propositional team logic. This requires going beyond the logical operations of classical propositional logic. We exhibit a hierarchy of logics between the smallest, viz. classical propositional logic, and the full propositional team logic. We characterize these different logics in several ways: first syntactically by their logical operations, and then semantically by the kind of sets of teams they are capable of defining. In several important cases we are able to find complete axiomatizations for these logics.
References in corpus (5)
Cited by in corpus (14)
- Questions and dependency in intuitionistic logic
- Positive Modal Logic Beyond Distributivity
- On Intermediate Inquisitive and Dependence Logics: An Algebraic Study
- State-based Modal Logics for Free Choice
- Team semantics for interventionist counterfactuals and causal dependence
- Axiomatizing modal inclusion logic and its variants
- On the Succinctness of Atoms of Dependency
- An Acceptance Semantics for Stable Modal Knowledge
- Esakia Duals of Regular Heyting Algebras
- Axiomatizations of Team Logics
- Two-dimensional Kripke Semantics II: Stability and Completeness
- Non-distributive positive logic as a fragment of first-order logic over semilattices
- Propositional union closed team logics
- Complexity Results in Team Semantics: Nonemptiness Is Not So Complex