Two constructions for adding an involution operator to residuated ordered monoids are investigated. One preserves integrality and the mingle axiom x 2x but fails to preserve the contraction property xx 2. The other has the opposite preservation properties. Both constructions preserve commutativity as well as existent nonempty meets and joins and self-dual order properties. Used in conjunction with either construction, a result of R.T. Brady can be seen to show that the equational theory of commutative distributive residuated lattices (without involution) (...) is decidable, settling a question implicitly posed by P. Jipsen and C. Tsinakis. The corresponding logical result is the (theorem-) decidability of the negation-free axioms and rules of the logic RW, formulated with fusion and the Ackermann constant t. This completes a result of S. Giambrone whose proof relied on the absence of t. (shrink)

A quasivariety of algebras has the joint embedding property (JEP) if and only if it is generated by a single algebra A. It is structurally complete if and only if the free ℵ0‐generated algebra in can serve as A. A consequence of this demand, called ‘passive structural completeness’ (PSC), is that the nontrivial members of all satisfy the same existential positive sentences. We prove that if is PSC then it still has the JEP, and if it has the JEP and (...) its nontrivial members lack trivial subalgebras, then its relatively simple members all belong to the universal class generated by one of them. Under these conditions, if is relatively semisimple then it is generated by one ‐simple algebra. We also prove that a quasivariety of finite type, with a finite nontrivial member, is PSC if and only if its nontrivial members have a common retract. The theory is then applied to the variety of De Morgan monoids, where we isolate the sub(quasi)varieties that are PSC and those that have the JEP, while throwing fresh light on those that are structurally complete. The results illuminate the extension lattices of intuitionistic and relevance logics. (shrink)

This paper provides a semantic analysis of admissible rules and associated completeness conditions for arbitrary deductive systems, using the framework of abstract algebraic logic. Algebraizability is not assumed, so the meaning and significance of the principal notions vary with the level of the Leibniz hierarchy at which they are presented. As a case study of the resulting theory, the nonalgebraizable fragments of relevance logic are considered.

This paper develops an order-theoretic generalization of Blok and Pigozziʼs notion of an algebraizable logic. Unavoidably, the ordered model class of a logic, when it exists, is not unique. For uniqueness, the definition must be relativized, either syntactically or semantically. In sentential systems, for instance, the order algebraization process may be required to respect a given but arbitrary polarity on the signature. With every deductive filter of an algebra of the pertinent type, the polarity associates a reflexive and transitive relation (...) called a Leibniz order, analogous to the Leibniz congruence of abstract algebraic logic . Some core results of AAL are extended here to sentential systems with a polarity. In particular, such a system is order algebraizable if the Leibniz order operator has the following four independent properties: it is injective, it is isotonic, it commutes with the inverse image operator of any algebraic homomorphism, and it produces anti-symmetric orders when applied to filters that define reduced matrix models. Conversely, if a sentential system is order algebraizable in some way, then the order algebraization process naturally induces a polarity for which the Leibniz order operator has properties –. (shrink)

A full separation theorem for the derivable rules of intuitionistic linear logic without bounds, 0 and exponentials is proved. Several structural consequences of this theorem for subreducts of (commutative) residuated lattices are obtained. The theorem is then extended to the logic LR+ and its proof is extended to obtain the finite embeddability property for the class of square increasing residuated lattices.

For (finitary) deductive systems, we formulate a signature‐independent abstraction of the weak excluded middle law (WEML), which strengthens the existing general notion of an inconsistency lemma (IL). Of special interest is the case where a quasivariety algebraizes a deductive system ⊢. We prove that, in this case, if ⊢ has a WEML (in the general sense) then every relatively subdirectly irreducible member of has a greatest proper ‐congruence; the converse holds if ⊢ has an inconsistency lemma. The result extends, in (...) a suitable form, to all protoalgebraic logics. A super‐intuitionistic logic possesses a WEML iff it extends. We characterize the IL and the WEML for normal modal logics and for relevance logics. A normal extension of has a global consequence relation with a WEML iff it extends, while every axiomatic extension of with an IL has a WEML. (shrink)

This paper establishes several algebraic embedding theorems, each of which asserts that a certain kind of residuated structure can be embedded into a richer one. In almost all cases, the original structure has a compatible involution, which must be preserved by the embedding. The results, in conjunction with previous findings, yield separative axiomatizations of the deducibility relations of various substructural formal systems having double negation and contraposition axioms. The separation theorems go somewhat further than earlier ones in the literature, which (...) either treated fewer subsignatures or focussed on the conservation of theorems only. (shrink)

It is proved that the variety of relevant disjunction lattices has the finite embeddability property. It follows that Avron's relevance logic RMImin has a strong form of the finite model property, so it has a solvable deducibility problem. This strengthens Avron's result that RMImin is decidable.

We exhibit infinitely many semisimple varieties of semilinear De Morgan monoids (and likewise relevant algebras) that are not tabular, but which have only tabular proper subvarieties. Thus, the extension of relevance logic by the axiom $$(p\rightarrow q)\vee (q\rightarrow p)$$ ( p → q ) ∨ ( q → p ) has infinitely many pretabular axiomatic extensions, regardless of the presence or absence of Ackermann constants.

This paper deals with axiomatization problems for varieties of residuated meet semilattice-ordered monoids. An internal characterization of the finitely subdirectly irreducible RSs is proved, and it is used to investigate the varieties of RSs within which the finitely based subvarieties are closed under finite joins. It is shown that a variety has this closure property if its finitely subdirectly irreducible members form an elementary class. A syntactic characterization of this hypothesis is proved, and examples are discussed.