Authors
Joao Marcos
Universidade Federal do Rio Grande do Norte
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$.
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.1093/jigpal/jzaa015
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 60,826
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

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 Really Contraction Free.Greg Restall - 1993 - Studia Logica 52 (3):381 - 391.

View all 14 references / Add more references

Citations of this work BETA

No citations found.

Add more citations

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 index
2020-05-10

Total views
3 ( #1,304,464 of 2,438,796 )

Recent downloads (6 months)
1 ( #436,491 of 2,438,796 )

How can I increase my downloads?

Downloads

Sorry, there are not enough data points to plot this chart.

My notes