Nelson’s logic ????

Logic Journal of the IGPL 28 (6):1182-1206 (2020)
  Copy   BIBTEX

Abstract

Besides the better-known Nelson logic and paraconsistent Nelson logic, 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 with infinitely many rule schemata and no semantics. We look here at the propositional fragment of $\mathcal{S}$, showing that it is algebraizable, 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$.

Author Profiles

Umberto Rivieccio
Universidad Nacional de Educación a Distancia
Joao Marcos
Universidade Federal do Rio Grande do Norte

Analytics

Added to PP
2020-05-10

Downloads
74 (#89,592)

6 months
64 (#68,073)

Historical graph of downloads since first upload
This graph includes both downloads from PhilArchive and clicks on external links on PhilPapers.
How can I increase my downloads?