Propositional union closed team logics
Author:
Preprint
Abstract
In this paper, we study several propositional team logics that are closed under unions, including propositional inclusion logic. We prove that all these logics are expressively complete, and we introduce sound and complete systems of natural deduction for these logics. We also discuss the locality property and its connection with interpolation in these logics.Keywords
All Related Versions
This publication has 10 references indexed in Scilit:
- Logic and conversation: The case of free choiceSemantics and Pragmatics, 2022
- Axiomatizing first order consequences in inclusion logicMathematical Logic Quarterly, 2020
- Negation and partial axiomatizations of dependence and independence logic revisitedAnnals of Pure and Applied Logic, 2019
- Structural completeness in propositional logics of dependenceArchive for Mathematical Logic, 2016
- Axiomatizing first-order consequences in independence logicAnnals of Pure and Applied Logic, 2015
- Hierarchies in independence and inclusion logic with strict semanticsJournal of Logic and Computation, 2014
- Inclusion and exclusion dependencies in team semantics — On some logics of imperfect informationAnnals of Pure and Applied Logic, 2012
- Basic Proof Theory2000
- Compositional semantics for a language of imperfect informationLogic Journal of the IGPL, 1997
- On the Union Closed Fragment of Existential Second-Order Logic and Logics with Team Semantics