Document type
ArticleVersion
Submitted versionPublication date
All rights reserved
Please use this identifier to cite or link to this item: https://hdl.handle.net/2445/152419
Product logic and the deduction theorem
Journal Title
Director/Tutor
Journal ISSN
Volume Title
Related resource
Abstract
In this paper we prove the following negative result: Product Logic [9] does not have the Deduction Theorem, that is, there is no binary defined connective in the language of Product Logic such that the Deduction Theorem is satisfied with respect to it. We prove this theorem mainly by using algebraic methods: we prove that Product Logic is algebraizable, that the variety of Product Algebras is its equivalent
quasivariety semantics and that this variety has no equationally definable principal congruences.
Description
Preprint enviat per a la seva publicació en una revista científica.
Subject
Subject (English)
Citation
Citation
ADILLÓN, Román and VERDÚ, B. (Buenaventura). Product logic and the deduction theorem. [consulted: 15 of August of 2026]. Available at: https://hdl.handle.net/2445/152419