There are (other) ways to negate in propositional team semantics
Fuente:
arXiv
Guardado en:
| Autor principal: | |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866916444225142784 |
|---|---|
| author | Yang, Fan |
| author_facet | Yang, Fan |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2410_08413 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | There are (other) ways to negate in propositional team semantics Yang, Fan Logic Logic in Computer Science 03B60 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. |
| title | There are (other) ways to negate in propositional team semantics |
| topic | Logic Logic in Computer Science 03B60 |
| url | https://arxiv.org/abs/2410.08413 |