Matrices, primitive satisfaction and finitely based logics (Q1080413): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Primitive Satisfaction and Equational Problems for Lattices and Other Algebras / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Some theorems on structural consequence operations / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Equivalential logics. I / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Equivalential logics. II / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4187823 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4196408 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Matrix approach in methodology of sentential calculi / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 15:29, 17 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Matrices, primitive satisfaction and finitely based logics |
scientific article |
Statements
Matrices, primitive satisfaction and finitely based logics (English)
0 references
1983
0 references
\textit{K. A. Baker}'s primitive satisfaction theorem (stated for congruence-distributive equational classes of algebras [cf. Trans. Am. Math. Soc. 190, 125-150 (1974; Zbl 0291.08001)]) is modified and reformulated so as to apply to a class of logical matrices Matr(C) such that the lattice of C-filters is distributive. A matrix version of Jónsson's lemma is a corollary to this theorem. Then some properties of propositional logics with disjunction are studied. The main result states that a standard finitely equivalent logic C with disjunction can be axiomatized by a finite number of rule schemata if and only if the class of finitely subdirectly irreducible matrices in the class Matr(C) is finitely (first-order) axiomatizable.
0 references
axiomatizability
0 references
primitive satisfaction theorem
0 references
logical matrices
0 references
lattice of C-filters
0 references
matrix version of Jónsson's lemma
0 references
propositional logics with disjunction
0 references
equivalent logic
0 references