Algebraic semantics for deductive systems

Studia Logica 74 (1-2):153 - 180 (2003)
  Copy   BIBTEX

Abstract

The notion of an algebraic semantics of a deductive system was proposed in [3], and a preliminary study was begun. The focus of [3] was the definition and investigation of algebraizable deductive systems, i.e., the deductive systems that possess an equivalent algebraic semantics. The present paper explores the more general property of possessing an algebraic semantics. While a deductive system can have at most one equivalent algebraic semantics, it may have numerous different algebraic semantics. All of these give rise to an algebraic completeness theorem for the deductive system, but their algebraic properties, unlike those of equivalent algebraic semantics, need not reflect the metalogical properties of the deductive system. Many deductive systems that don't have an equivalent algebraic semantics do possess an algebraic semantics; examples of these phenomena are provided. It is shown that all extensions of a deductive system that possesses an algebraic semantics themselves possess an algebraic semantics. Necessary conditions for the existence of an algebraic semantics are given, and an example of a protoalgebraic deductive system that does not have an algebraic semantics is provided. The mono-unary deductive systems possessing an algebraic semantics are characterized. Finally, weak conditions on a deductive system are formulated that guarantee the existence of an algebraic semantics. These conditions are used to show that various classes of non-algebraizable deductive systems of modal logic, relevance logic and linear logic do possess an algebraic semantics.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 90,221

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2009-01-28

Downloads
54 (#262,706)

6 months
2 (#658,848)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

On the complexity of the Leibniz hierarchy.Tommaso Moraschini - 2019 - Annals of Pure and Applied Logic 170 (7):805-824.
The simplest protoalgebraic logic.Josep Maria Font - 2013 - Mathematical Logic Quarterly 59 (6):435-451.
Representations of structural closure operators.José Gil-Férez - 2011 - Archive for Mathematical Logic 50 (1-2):45-73.

View all 10 citations / Add more citations

References found in this work

Protoalgebraic logics.W. J. Blok & Don Pigozzi - 1986 - Studia Logica 45 (4):337 - 369.
Algebraic semantics for quasi-classical modal logics.W. J. Blok & P. Köhler - 1983 - Journal of Symbolic Logic 48 (4):941-964.
Remarks on Sentential Logics.R. Suszko - 1975 - Journal of Symbolic Logic 40 (4):603-604.

Add more references