4 research outputs found
Inconsistency lemmas in algebraic logic
In this paper, the inconsistency lemmas of intuitionistic and classical propositional logic are formulated abstractly.
We prove that, when a (finitary) deductive system is algebraized by a variety K, then has an inconsistency
lemma—in the abstract sense—iff every algebra in K has a dually pseudo-complemented join semilattice of
compact congruences. In this case, the following are shown to be equivalent: (1) has a classical inconsistency
lemma; (2) has a greatest compact theory and K is filtral, i.e., semisimple with EDPC; (3) the compact
congruences of any algebra in K form a Boolean lattice; (4) the compact congruences of any A ∈ K constitute
a Boolean sublattice of the full congruence lattice of A. These results extend to quasivarieties and relative
congruences. Except for (2), they extend even to protoalgebraic logics, with deductive filters in the role of
congruences. A protoalgebraic system with a classical inconsistency lemma always has a deduction-detachment
theorem (DDT), while a system with a DDT and a greatest compact theory has an inconsistency lemma. The
converses are false.http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1521-3870hb201
Relative congruence formulas and decompositions in quasivarieties
Quasivarietal analogues of uniform congruence schemes are discussed, and their relationship with the equational definability of principal relative congruences (EDPRC) is established, along with their significance for relative congruences on subalgebras of products. Generalizing the situation in varieties, we prove that a quasivariety is relatively ideal iff it has EDPRC; it is relatively filtral iff it is relatively semisimple with EDPRC. As an application, it is shown that a finitary sentential logic, algebraized by a quasivariety K, has a classical inconsistency lemma if and only if K is relatively filtral and the subalgebras of its nontrivial members are nontrivial. A concrete instance of this result is exhibited, in which K is not a variety. Finally, for quasivarieties M⊆K, we supply some conditions under which M is the restriction to K of a variety, assuming that K has EDPRC.The second author was supported in part by the National Research Foundation of South Africa (UID 85407).https://link.springer.com/journal/122482018-11-27hj2017Mathematics and Applied Mathematic
Idempotent residuated structures : some category equivalences and their applications
This paper concerns residuated lattice-ordered idempotent commutative
monoids that are subdirect products of chains. An algebra of this
kind is a generalized Sugihara monoid (GSM) if it is generated by the lower
bounds of the monoid identity; it is a Sugihara monoid if it has a compatible
involution :. Our main theorem establishes a category equivalence
between GSMs and relative Stone algebras with a nucleus (i.e., a closure
operator preserving the lattice operations). An analogous result is obtained
for Sugihara monoids. Among other applications, it is shown that Sugihara
monoids are strongly amalgamable, and that the relevance logic RMt has
the projective Beth de nability property for deduction.http://www.ams.org//journals/tran/hb201