A paraconsistent route to semantic closure

Logic Journal of the IGPL 25 (4):387-407 (2017)
Download Edit this record How to cite View on PhilPapers
Abstract
In this paper, we present a non-trivial and expressively complete paraconsistent naïve theory of truth, as a step in the route towards semantic closure. We achieve this goal by expressing self-reference with a weak procedure, that uses equivalences between expressions of the language, as opposed to a strong procedure, that uses identities. Finally, we make some remarks regarding the sense in which the theory of truth discussed has a property closely related to functional completeness, and we present a sound and complete three-sided sequent calculus for this expressively rich theory.
Keywords
No keywords specified (fix it)
Categories
(categorize this paper)
PhilPapers/Archive ID
BARAPR-3
Revision history
Archival date: 2018-11-29
View upload history
References found in this work BETA
The Logic of Paradox.Priest, Graham

View all 14 references / Add more references

Citations of this work BETA
A Recovery Operator for Nontransitive Approaches.Barrio, Eduardo Alejandro; Pailos, Federico & Szmuc, Damian

Add more citations

Added to PP index
2017-06-27

Total views
19 ( #37,740 of 39,912 )

Recent downloads (6 months)
8 ( #34,292 of 39,912 )

How can I increase my downloads?

Downloads since first upload
This graph includes both downloads from PhilArchive and clicks to external links.