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$.

Similar books and articles

Limits for Paraconsistent Calculi.Walter A. Carnielli & João Marcos - 1999 - Notre Dame Journal of Formal Logic 40 (3):375-390.
Partitions of large Rado graphs.M. Džamonja, J. A. Larson & W. J. Mitchell - 2009 - Archive for Mathematical Logic 48 (6):579-606.
Fully Fregean logics.Sergei Babyonyshev - 2003 - Reports on Mathematical Logic:59-77.
An example related to Gregory’s Theorem.J. Johnson, J. F. Knight, V. Ocasio & S. VanDenDriessche - 2013 - Archive for Mathematical Logic 52 (3-4):419-434.
Classical Modal De Morgan Algebras.Sergio A. Celani - 2011 - Studia Logica 98 (1-2):251-266.
Semi-intuitionistic Logic.Juan Manuel Cornejo - 2011 - Studia Logica 98 (1-2):9-25.
Syntax and Semantics of the Logic $\mathcal{L}^\lambda_{\omega\omega}$.Carsten Butz - 1997 - Notre Dame Journal of Formal Logic 38 (3):374-384.
Embedding FD(ω) into {mathcal{P}_s} densely.Joshua A. Cole - 2008 - Archive for Mathematical Logic 46 (7-8):649-664.
Observables and Statistical Maps.Stan Gudder - 1999 - Foundations of Physics 29 (6):877-897.
Self-adjoint extensions by additive perturbations.Andrea Posilicano - 2003 - Annali della Scuola Normale Superiore di Pisa- Classe di Scienze 2 (1):1-20.
A fixed point for the jump operator on structures.Antonio Montalbán - 2013 - Journal of Symbolic Logic 78 (2):425-438.

Analytics

Added to PP
2020-05-10

Downloads
75 (#219,167)

6 months
65 (#73,248)

Historical graph of downloads
How can I increase my downloads?

Author Profiles

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

Citations of this work

Improving Strong Negation.Satoru Niki - 2023 - Review of Symbolic Logic 16 (3):951-977.

Add more citations

References found in this work

Constructible falsity.David Nelson - 1949 - Journal of Symbolic Logic 14 (1):16-26.
Constructible falsity and inexact predicates.Ahmad Almukdad & David Nelson - 1984 - Journal of Symbolic Logic 49 (1):231-233.
Logics without the contraction rule.Hiroakira Ono & Yuichi Komori - 1985 - Journal of Symbolic Logic 50 (1):169-201.
How to be R eally Contraction-Free.Greg Restall - 1993 - Studia Logica 52 (3):381 - 391.

View all 15 references / Add more references