A paraconsistent route to semantic closure

Logic Journal of the IGPL 25 (4):387-407 (2017)
  Copy   BIBTEX

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.

Similar books and articles

Partial and paraconsistent three-valued logics.Vincent Degauquier - 2016 - Logic and Logical Philosophy 25 (2):143-171.
A Paraconsistent Conditional Logic.Minghui Ma & Chun-Ting Wong - 2020 - Journal of Philosophical Logic 49 (5):883-903.
Semantic closure, descriptions and non-triviality.Graham Priest - 1999 - Journal of Philosophical Logic 28 (6):549--558.
From Closure Games to Strong Kleene Truth.Stefan Wintein - 2016 - Notre Dame Journal of Formal Logic 57 (2):153-179.
Classical Logic is not Uniquely Characterizable.Isabella McAllister - 2022 - Journal of Philosophical Logic 51 (6):1345-1365.

Analytics

Added to PP
2017-06-27

Downloads
414 (#50,463)

6 months
123 (#36,202)

Historical graph of downloads
How can I increase my downloads?

Author Profiles

Eduardo Alejandro Barrio
Universidad de Buenos Aires (UBA)
Federico Pailos
Universidad de Buenos Aires (UBA)
Damian Szmuc
Universidad de Buenos Aires (UBA)

References found in this work

Outline of a theory of truth.Saul Kripke - 1975 - Journal of Philosophy 72 (19):690-716.
The logic of paradox.Graham Priest - 1979 - Journal of Philosophical Logic 8 (1):219 - 241.
Paradox without Self-Reference.Stephen Yablo - 1993 - Analysis 53 (4):251-252.

View all 15 references / Add more references