Matrices, primitive satisfaction and finitely based logics

Studia Logica 42 (1):89 - 104 (1983)

Authors
Abstract
We examine the notion of primitive satisfaction in logical matrices. Theorem II. 1, being the matrix counterpart of Baker's well-known result for congruently distributive varieties of algebras (cf [1], Thm. 1.5), links the notions of primitive and standard satisfaction. As a corollary we give the matrix version of Jónsson's Lemma, proved earlier in [4]. Then we investigate propositional logics with disjunction. The main result, Theorem III. 2, states a necessary and sufficient condition for such logics to be finitely based.
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.1007/BF01418762
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 44,365
Through your library

References found in this work BETA

Equivalential Logics (I).Janusz Czelakowski - 1981 - Studia Logica 40 (3):227 - 236.
Equivalential logics.Janusz Czelakowski - 1981 - Studia Logica 40 (3):227-236.
Equivalential Logics (II).Janusz Czelakowski - 1981 - Studia Logica 40 (4):355 - 372.

View all 9 references / Add more references

Citations of this work BETA

Protoalgebraic Logics.W. J. Blok & Don Pigozzi - 1986 - Studia Logica 45 (4):337 - 369.
Algebraic Aspects of Deduction Theorems.Janusz Czelakowski - 1985 - Studia Logica 44 (4):369 - 387.
Local Deductions Theorems.Janusz Czelakowski - 1986 - Studia Logica 45 (4):377 - 391.

View all 10 citations / Add more citations

Similar books and articles

Analytics

Added to PP index
2009-01-28

Total views
28 ( #311,806 of 2,271,612 )

Recent downloads (6 months)
7 ( #166,552 of 2,271,612 )

How can I increase my downloads?

Downloads

My notes

Sign in to use this feature