Algebraizable Weak Logics
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2022
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909991079772160 |
|---|---|
| author | Nakov, Georgi Quadrellaro, Davide Emilio |
| author_facet | Nakov, Georgi Quadrellaro, Davide Emilio |
| contents | We extend the framework of abstract algebraic logic to weak logics, namely logical systems which are not necessarily closed under uniform substitution. We interpret weak logics by algebras expanded with an additional predicate and we introduce a loose and strict version of algebraizability for weak logics. We study this framework by investigating the connection between the algebraizability of a weak logic and the algebraizability of its schematic fragment, and we then prove a version of Blok and Pigozzi's Isomorphism Theorem in our setting. We apply this framework to logics in team semantics and show that the classical versions of inquisitive and dependence logic are strictly algebraizable, while their intuitionistic versions are only loosely so. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2210_06047 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | Algebraizable Weak Logics Nakov, Georgi Quadrellaro, Davide Emilio Logic 03G27, 03C05, 03B55, 03B50 We extend the framework of abstract algebraic logic to weak logics, namely logical systems which are not necessarily closed under uniform substitution. We interpret weak logics by algebras expanded with an additional predicate and we introduce a loose and strict version of algebraizability for weak logics. We study this framework by investigating the connection between the algebraizability of a weak logic and the algebraizability of its schematic fragment, and we then prove a version of Blok and Pigozzi's Isomorphism Theorem in our setting. We apply this framework to logics in team semantics and show that the classical versions of inquisitive and dependence logic are strictly algebraizable, while their intuitionistic versions are only loosely so. |
| title | Algebraizable Weak Logics |
| topic | Logic 03G27, 03C05, 03B55, 03B50 |
| url | https://arxiv.org/abs/2210.06047 |