There are (other) ways to negate in propositional team semantics
Logic
2024-10-21 v1 Logic in Computer Science
Abstract
The languages of logics based on team semantics typically only allow atomic negation or restricted negation. In this paper, we explore propositional team-based logics with full (intuitionistic) negation. We demonstrate that including full intutionistic negation does not complicate the axiomatization of propositional team-based logics with the downward closure property. We also review known expressive completeness results for these logics, highlighting how relevant complemented properties are expressed in propositional dependence logic without directly using negation. Building on these insights, we also prove a new result: propositional logic extended with both dependence and inclusion atoms is expressively complete.
Keywords
Cite
@article{arxiv.2410.08413,
title = {There are (other) ways to negate in propositional team semantics},
author = {Fan Yang},
journal= {arXiv preprint arXiv:2410.08413},
year = {2024}
}