Expressibility and inexpressibility in propositional team logics
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866908854510419968 |
|---|---|
| author | Häggblom, Matilda Hirvonen, Minna Väänänen, Jouko |
| author_facet | Häggblom, Matilda Hirvonen, Minna Väänänen, Jouko |
| contents | We develop dimension theoretic methods for propositional team based logics. Such quantitative methods were defined for team based first-order logic in a recent paper by Hella, Luosto and the third author and were used to obtain strong hierarchy results in the first-order logic context. We show that in propositional logic and in several important cases, a team theoretical atom can be expressed in terms of atoms of lower arity. We estimate the `price' of such a reduction of arity, i.e. how much more complicated the new expression is. Our estimates involve as parameters the arity of the atoms involved, as well as the number of times the atom occurs in a formula. We also consider new variants of atoms and propositional operations, inspired by our work. We believe that our quantitative analysis leads to a deeper understanding of the scope and limits of propositional team based logic. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2512_15680 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Expressibility and inexpressibility in propositional team logics Häggblom, Matilda Hirvonen, Minna Väänänen, Jouko Logic 03B60 We develop dimension theoretic methods for propositional team based logics. Such quantitative methods were defined for team based first-order logic in a recent paper by Hella, Luosto and the third author and were used to obtain strong hierarchy results in the first-order logic context. We show that in propositional logic and in several important cases, a team theoretical atom can be expressed in terms of atoms of lower arity. We estimate the `price' of such a reduction of arity, i.e. how much more complicated the new expression is. Our estimates involve as parameters the arity of the atoms involved, as well as the number of times the atom occurs in a formula. We also consider new variants of atoms and propositional operations, inspired by our work. We believe that our quantitative analysis leads to a deeper understanding of the scope and limits of propositional team based logic. |
| title | Expressibility and inexpressibility in propositional team logics |
| topic | Logic 03B60 |
| url | https://arxiv.org/abs/2512.15680 |