Algebraic aspects of deduction theorems
type: Item
instance of: scholarly article
title: Algebraic aspects of deduction theorems
zbMATH Open document ID: 0612.03016
DOI: 10.1007/BF00370428
author: Janusz Czelakowski
published in: Studia Logica
publication date: 1985-01-01T00:00:00Z
review text: The present paper contains an analysis of closure spaces associated with those sequential logics which admit various deduction theorems. For purely algebraic reasons it is convenient to view deduction theorems in a more general form: given a sentential logic C (identified with a structural consequence operation) in a sequential language \({\mathcal S}\), a quite arbitrary set P of formulas of \({\mathcal S}\) built up with at most two distinct sentential variables p and q is called a uniform deduction theorem scheme for C if it satisfies the following condition: for every set X of formulas of \({\mathcal S}\) and for any formulas \(\alpha\) and \(\beta\), \(\beta\in C(X\cup \{\alpha \})\) iff \(P(\alpha,\beta) \subseteq C(X)\). \([P(\alpha,\beta)\) denotes the set of formulas which result by the simultaneous substitution of \(\alpha\) for p and \(\beta\) for q in all formulas in P.] The above definition encompasses many particular formulations of theorems considered in the literature to be deduction theorems. Theorem 1.3 gives necessary and sufficient conditions for a logic to have a uniform deduction theorem scheme. Then, given a sentential logic C with a uniform deduction theorem scheme, the lattices of deductive filters on the algebras \({\mathcal A}\) similar to the language of C are investigated. It is shown that the join-semilattice of finitely generated \((=compact)\) deductive filters on each algebra \({\mathcal A}\) is dually Brouwerian. The crucial result of the paper - Theorem 2.11 - states that for a very wide class of logics the converse of the above result also holds. More specifically, if C is a standard logic for which there exists a set \(\Lambda(p,q)\) of sentential formulas build up with two variables such that \(\Lambda(p,p) \subseteq C(\emptyset)\) and \(q\in C(\Lambda (p,q)\cup \{p\})\) then C has a uniform deduction theorem scheme iff for every algebra \({\mathcal A}\) similar to the language of C, the join- semilattice of compact deductive fi…
Mathematics Subject Classification ID: 03B99
Mathematics Subject Classification ID: 03G10
zbMATH DE Number: 3989330
zbMATH Keywords: closure spaces
zbMATH Keywords: sequential logics
zbMATH Keywords: structural consequence operation
zbMATH Keywords: uniform deduction theorem scheme
zbMATH Keywords: lattices of deductive filters
MaRDI profile type: Publication
cites work: The lattice of modal logics: an algebraic investigation
cites work: Reduced products of logical matrices
cites work: Equivalential logics. I
cites work: Matrices, primitive satisfaction and finitely based logics
cites work: Algebraic completeness results for R-mingle and its extensions
cites work: Varieties with equationally definable principal congruences
cites work: Q3268305
cites work: Q5555713
cites work: A survey of deduction theorems for the propositional calculi
cites work: Q3962962
cites work: Q3898495
cites work: Matrix approach in methodology of sentential calculi
full work available at URL: https://doi.org/10.1007/bf00370428
OpenAlex ID: W2093865192
description: scientific article; zbMATH DE number 3989330