Quasi-N4-lattices

Abstract

Within the Nelson family, two mutually incomparable generalizations of Nelson constructive logic with strong negation have been proposed so far. The first and more well-known, Nelson paraconsistent logic, results from dropping the explosion axiom of Nelson logic; a more recent series of papers considers the logic (dubbed quasi-Nelson logic) obtained by rejecting the double negation law, which is thus also weaker than intuitionistic logic. The algebraic counterparts of these logical calculi are the varieties of N4-lattices and quasi-Nelson algebras. In the present paper we propose the class of quasi-N4-lattices as a common generalization of both. We show that a number of key results, including the twist-structure representation of N4-lattices and quasi-Nelson algebras, can be uniformly established in this more general setting; our new representation employs twist-structures defined over Brouwerian algebras enriched with a nucleus operator. We further show that quasi-N4-lattices form a variety that is arithmetical, possesses a ternary as well as a quaternary deductive term, and enjoys EDPC and the strong congruence extension property.

Fragments of quasi-Nelson: residuation

“…quasi-Nelson algebras: Definition 2.8). Twist representations covering these two cases have been introduced, respectively, in Odintsov (2004) and Rivieccio and Spinks (2019); both may in fact be seen as special cases of the construction recently proposed in Rivieccio (2022b).…”