nelson logic
Recently Published Documents


TOTAL DOCUMENTS

12
(FIVE YEARS 6)

H-INDEX

2
(FIVE YEARS 1)

2021 ◽  
Author(s):  
Umberto Rivieccio

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.


2021 ◽  
Vol 27 (1) ◽  
pp. 107-123
Author(s):  
Thiago Nascimento ◽  
Umberto Rivieccio

Quasi-Nelson logic is a recently-introduced generalization of Nelson’s constructive logic with strong negation to a non-involutive setting. In the present paper we axiomatize the negation-implication fragment of quasi-Nelson logic (QNI-logic), which constitutes in a sense the algebraizable core of quasi-Nelson logic. We introduce a finite Hilbert-style calculus for QNI-logic, showing completeness and algebraizability with respect to the variety of QNI-algebras. Members of the latter class, also introduced and investigated in a recent paper, are precisely the negation-implication subreducts of quasi-Nelson algebras. Relying on our completeness result, we also show how the negation-implication fragments of intuitionistic logic and Nelson’s constructive logic may both be obtained as schematic extensions of QNI-logic.


Author(s):  
Umberto Rivieccio ◽  
Ramon Jansana

Abstract The variety of quasi-Nelson algebras (QNAs) has been recently introduced and characterised in several equivalent ways: among others, as (1) the class of bounded commutative integral (but non-necessarily involutive) residuated lattices satisfying the Nelson identity, as well as (2) the class of (0, 1)-congruence orderable commutative integral residuated lattices. Logically, QNAs are the algebraic counterpart of quasi-Nelson logic, which is the (algebraisable) extension of the substructural logic ℱℒ ew (Full Lambek calculus with Exchange and Weakening) by the Nelson axiom. In the present paper, we collect virtually all the results that are currently known on QNAs, including solutions to certain questions left open in earlier publications. Furthermore, we extend our study to some subreducts of QNAs, that is, classes of algebras corresponding to fragments of the algebraic language obtained by eliding either the implication or the lattice operations.


2020 ◽  
Author(s):  
Francesc Esteva ◽  
Aldo Figallo Orellano ◽  
Tommaso Flaminio ◽  
Lluís Godo

The main aim of this paper is defining a Logic of Formal Inconsistency over the degree-preserving companion of Nelson logic with a consistency operator. In this sense, we present a quasivariety of Nelson lattices enriched with a suitable consistency operator and axiomatise the corresponding logic. As main results we present necessary and sufficient conditions to prove a categorial equivalence for the category for Nelson lattices with a consistency operator.


Author(s):  
Thiago Nascimento ◽  
Umberto Rivieccio ◽  
João Marcos ◽  
Matthew Spinks

Abstract Besides the better-known Nelson logic ($\mathcal{N}3$) and paraconsistent Nelson logic ($\mathcal{N}4$), in 1959 David Nelson introduced, with motivations of realizability and constructibility, a logic called $\mathcal{S}$. The logic $\mathcal{S}$ was originally presented by means of a calculus (crucially lacking the contraction rule) with infinitely many rule schemata and no semantics (other than the intended interpretation into Arithmetic). We look here at the propositional fragment of $\mathcal{S}$, showing that it is algebraizable (in fact, implicative), in the sense of Blok and Pigozzi, with respect to a variety of three-potent involutive residuated lattices. We thus introduce the first known algebraic semantics for $\mathcal{S}$ as well as a finite Hilbert-style calculus equivalent to Nelson’s presentation; this also allows us to clarify the relation between $\mathcal{S}$ and the other two Nelson logics $\mathcal{N}3$ and $\mathcal{N}4$.


2018 ◽  
Vol 11 (4) ◽  
pp. 805-820 ◽  
Author(s):  
HITOSHI OMORI ◽  
HEINRICH WANSING

AbstractIn two recent articles, Norihiro Kamide introduces unusual variants of Nelson’s paraconsistent logic and its classical extension. Kamide’s systems, IP and CP, are unusual insofar as double negations in these logics behave as intuitionistic and classical negations, respectively. In this article we present Hilbert-style axiomatizations of both IP and CP. The axiom system for IP is shown to be sound and complete with respect to a four-valued Kripke semantics, and the axiom system for CP is characterized by four-valued truth tables. Moreover, we note some properties of IP and CP, and emphasize that these logics are unusual also because they are contra-classical and inconsistent but nontrivial. We point out that Kamide’s approach exemplifies a general method for obtaining contra-classical logics, and we briefly speculate about a linguistic application of Kamide’s logics.


10.29007/p4ch ◽  
2018 ◽  
Author(s):  
Ramon Jansana ◽  
Umberto Rivieccio

N4-lattices are the algebraic semantics of paraconsistent Nelson logic, which was introduced as an inconsistency-tolerant counterpart of the better-known logic of Nelson. Paraconsistent Nelson logic combines interesting features of intuitionistic, classical and many-valued logics (e.g., Belnap-Dunn four-valued logic); recent work has shown that it can also be seen as one member of the wide family of substructural logics.The work we present here is a contribution towards a better topological understanding of the algebraic counterpart of paraconsistent Nelson logic, namely a variety of involutive lattices called N4-lattices.


Sign in / Sign up

Export Citation Format

Share Document