Tipus de document

Article

Versió

Versió publicada

Data de publicació

Llicència de publicació

cc-by (c) Pra Baldi, Michele et al., 2025
Si us plau utilitzeu sempre aquest identificador per citar o enllaçar aquest document: https://hdl.handle.net/2445/231779

Equational definitions of logical filters

Títol de la revista

Director/Tutor

Contribució addicional

ISSN de la revista

Títol del volum

Resum

A finitary propositional logic can be given an algebraic reading in two different ways: by translating formulas into equations and logical rules into quasi-equations, or by translating logical rules directly into equations. The former type of algebraic interpretation has been extensively studied and underlies the theory of algebraization, whereas little systematic attention has been paid to the latter type. We investigate a semantic form of the latter type of algebraic interpretation, which we call the equational definability of compact filters (EDCF). Paralleling the well-studied hierarchy of variants of the deduction–detachment theorem (DDT), this property also comes in local, parametrized, and parametrized local variants. The main results of this paper characterize of each of these variants of the EDCF in a spirit similar to the existing characterizations of the DDT. While the EDCF hierarchy and the DDT hierarchy coincide for algebraizable logics, part of the interest of the EDCF stems from the fact it is often enjoyed even by logics which are not well-behaved in terms of other existing classifications in algebraic logic.

Citació

Citació

PRA BALDI, Michele and PŘENOSIL, Adam. Equational definitions of logical filters. Annals of Pure and Applied Logic. 2025. Vol. 176, num. 9. ISSN 0168-0072. [consulted: 1 of October of 2026]. Available at: https://hdl.handle.net/2445/231779

Exportar metadades

JSON - METS

Compartir registre