A glimpse of deductive systems in algebra (Q607435): Difference between revisions

The concept of deductive systems, introduced by Diego (1965), is an algebraic counterpart of a theory closed under modus ponens, and it has become an important tool in the algebra of logic. The structures occurring in the algebra of logic are usually endowed with an operation \(\rightarrow \), called implication, and the concept of a deductive system makes sense for them. If the structure is also a (semi)lattice, then its deductive systems are usually (semi)lattice filters, and that is why they are sometimes called implicative filters, while the converse may or may not hold. It turns out that whenever deductive systems do not coincide with filters, another concept has been invented which is similar to or stronger than that of a filter and is equivalent to the concept of a deductive systems. The starting point of this paper is the existence of several repetitions in the study of algebras related to logic: certain results have identical formulations for various algebras, such as BL-algebras, MV-algebras, Hilbert algebras and others, while the proofs are very similar. The axiomatization proposed by the authors provides a uniform approach to the problem of determining the relationship between filters and deductive systems in various contexts. They find several simple conditions which ensure either an implication between these concepts or their equivalence. The results imply (most of) the theorems already known in the literature in this respect and a few new ones, and the proofs are direct, without a recourse to the logic described by the algebras under consideration.