Hostname: page-component-76d6cb85b7-jhrpq Total loading time: 0 Render date: 2026-07-13T19:07:24.558Z Has data issue: false hasContentIssue false

ALGEBRAIZABLE WEAK LOGICS

Published online by Cambridge University Press:  14 January 2026

GEORGI NAKOV
Affiliation:
DEPARTMENT OF COMPUTER AND INFORMATION SCIENCES UNIVERSITY OF STRATHCLYDE UK E-mail: georgi.nakov@strath.ac.uk
DAVIDE EMILIO QUADRELLARO*
Affiliation:
ISTITUTO NAZIONALE DI ALTA MATEMATICA “FRANCESCO SEVERI” ROME, ITALY DEPARTMENT OF MATHEMATICS “GIUSEPPE PEANO” UNIVERSITY OF TURIN TURIN, ITALY
Rights & Permissions [Opens in a new window]

Abstract

We extend the framework of abstract algebraic logic to weak logics, namely, logical systems that 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.

Information

Type
Article
Creative Commons
Creative Common License - CCCreative Common License - BY
This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (https://creativecommons.org/licenses/by/4.0/), which permits unrestricted re-use, distribution, and reproduction in any medium, provided the original work is properly cited.
Copyright
© The Author(s), 2026. Published by Cambridge University Press on behalf of The Association for Symbolic Logic
Figure 0

Figure 1 Double-negation elimination for statements and polar questions.

Figure 1

Figure 2 The inquisitive (dependence) algebras from Theorem 8.27.