Filter distributive logics
type: Item
instance of: scholarly article
title: Filter distributive logics
zbMATH Open document ID: 0578.03012
DOI: 10.1007/BF00370507
author: Janusz Czelakowski
published in: Studia Logica
publication date: 1984-01-01T00:00:00Z
review text: A deductive system C (or sentential logic) on the algebra S of formulas is filter distributive if the lattice of C-filters of A is distributive for all algebras A similar to S. (F is a C-filter of A if (A,F) is a matrix validating C.) \(Th(C)=\{X\subseteq S /\) \(C(X)=X\}\). Theorem II.5 gives a syntactic characterization of finite logics C for which the lattice \(<Th(C),\subseteq >\) is distributive. (A logic C is called finite if the operator C is algebraic.) Moreover, for C finite and equivalential, this is shown to be equivalent to the filter distributivity of C. (Equivalential logics, a concept similar to but weaker than Block and Pigozzi's ''algebraizable'' logics, were studied by the Author in Stud. Logica 40, 227-236, 355-372 (1981; Zbl 0476.03032 and Zbl 0492.03008).) A C-filter F is C-prime if it is finitely meet irreducible and a matrix (A,D) for C is C-prime if D is a C-prime filter. The Author investigates the condition that the class of C-prime matrices for C be axiomatizable (in the usual first order sense): Theorem V.2 states that if this condition holds for a finite filter distributive logic C, then any axiomatic strengthening C' of C whose class of C'-prime matrices is still axiomatizable, is obtained from C by adding a finite set of axioms. This and other results are on a pair with Baker's theorem on the finite basis for congruence distributive equational classes.
Mathematics Subject Classification ID: 03B99
Mathematics Subject Classification ID: 03G25
Mathematics Subject Classification ID: 06A15
Mathematics Subject Classification ID: 08B10
zbMATH DE Number: 3924755
zbMATH Keywords: algebra of formulas
zbMATH Keywords: lattice of filters
zbMATH Keywords: deductive system
zbMATH Keywords: sentential logic
zbMATH Keywords: syntactic characterization of finite logics
zbMATH Keywords: Equivalential logics
zbMATH Keywords: congruence distributive equational classes
reviewed by: Aldo Ursini
MaRDI profile type: Publication
cites work: Some theorems on structural consequence operations
cites work: Q3956998
cites work: Reduced products of logical matrices
cites work: Equivalential logics. I
cites work: Matrices, primitive satisfaction and finitely based logics
cites work: Q4187823
cites work: Q3268305
cites work: Deducibility and many-valuedness
cites work: Matrix approach in methodology of sentential calculi
full work available at URL: https://doi.org/10.1007/bf00370507
OpenAlex ID: W2041835071
Recommended article: Q4288802
Recommended article: Matrices, primitive satisfaction and finitely based logics
Recommended article: Q4271951
Recommended article: Equivalential and algebraizable logics
Recommended article: A perspective on the algebra of logic
Recommended article: A field guide to equational logic
Recommended article: Algebraizable logics. An exact reproduction of the text originally published in 1989 with an errata sheet prepared by the second author in 2014
Recommended article: Algebraizable logics
Recommended article: Q4025010
Recommended article: Q4873976
description: scientific article; zbMATH DE number 3924755