Finite basis theorem for filter-distributive protoalgebraic deductive systems and strict universal Horn classes
In the paper the following two main theorems are proved: (1) A finitely generated protoalgebraic strict universal Horn class that is filter-distributive is finitely based. (2) Every finitely generated axiomatic subclass of a filter-distributive, protoalgebraic strict universal Horn class is finitely based. The author gives three equivalent forms of these theorems, namely in terms of strict universal Horn classes, in terms of matrix-quasivarieties and in terms of \(\vec{k}\)-deductive systems. These theorems do not apply to sequent calculi. Also presented are many other related results, showing the new ones in a wider context. Thus the paper can be considered as a review of the results concerning filter-distributive protoalgebraic deductive systems and strict universal Horn classes.
- Quasivarieties with definable relative principal subcongruences
- The Beth property in algebraic logic
- Correspondences between gentzen and hilbert systems
- Relation formulas for protoalgebraic equality free quasivarieties; Pałasińska's theorem revisited
- Characterization of protoalgebraic \(k\)-deductive systems
- Contextual deduction theorems
- A gentle introduction to the Leibniz hierarchy
- Janusz Czelakowski's research on the theory of matrices and its applications in the seventies and eighties of the 20th century
This page was built for publication: Finite basis theorem for filter-distributive protoalgebraic deductive systems and strict universal Horn classes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1422452)
