A recovery operator for nontransitive approaches

Review of Symbolic Logic:1-25 (forthcoming)
Authors
Damian Szmuc
Universidad de Buenos Aires (UBA)
Eduardo Alejandro Barrio
University of Buenos Aires
Federico Pailos
Universidad de Buenos Aires (UBA)
Abstract
In some recent papers, Cobreros, Egré, Ripley and van Rooij have defended the idea that abandoning transitivity may lead to a solution to the trouble caused by semantic paradoxes. For that purpose, they develop the Strict-Tolerant approach, which leads them to entertain a non-transitive theory of truth, where the structural rule of Cut is not generally valid. However, that Cut fails in general in the target theory of truth does not mean that there are not certain safe instances of Cut involving semantic notions. In this paper we intend to meet the challenge of answering how to regain all the safe instances of Cut, in the language of the theory, making essential use of a unary recovery operator. To fulfill this goal, we will work within the so-called Goodship Project, which suggests that in order to have non-trivial naïve theories it is sufficient to formulate the corresponding self-referential sentences with suitable biconditionals. Nevertheless, a secondary aim of this paper is to propose a novel way to carry this project out, showing that the biconditionals in question can be totally classical. In the context of this paper, these biconditionals will be essentially used in expressing the self-referential sentences and, thus, as a collateral result of our work we will prove that none of the recoveries expected of the target theory can be non-trivially achieved if self-reference is expressed through identities.
Keywords Substructural Logics  Cut Rule  Recovery Operator  Paradoxes
Categories (categorize this paper)
DOI 10.1017/S1755020318000369
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

Our Archive
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

Outline of a Theory of Truth.Saul A. Kripke - 1975 - Journal of Philosophy 72 (19):690-716.
Paradoxes and Failures of Cut.David Ripley - 2013 - Australasian Journal of Philosophy 91 (1):139 - 164.
Tolerant, Classical, Strict.Pablo Cobreros, Paul Egré, David Ripley & Robert van Rooij - 2012 - Journal of Philosophical Logic 41 (2):347-385.

View all 25 references / Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

The Logics of Strict-Tolerant Logic.Eduardo Barrio, Lucas Rosenblatt & Diego Tajer - 2015 - Journal of Philosophical Logic 44 (5):551-571.
The Suszko Operator. Part I.Janusz Czelakowski - 2003 - Studia Logica 74 (1):181-231.
The Suszko Operator. Part I.Janusz Czelakowski - 2003 - Studia Logica 74 (1-2):181 - 231.
Comparing Substructural Theories of Truth.David Ripley - 2015 - Ergo: An Open Access Journal of Philosophy 2.
Too Good to Be “Just True”.Marcus Rossberg - 2013 - Thought: A Journal of Philosophy 2 (1):1-8.
Naive Modus Ponens and Failure of Transitivity.Andreas Fjellstad - 2016 - Journal of Philosophical Logic 45 (1):65-72.
Restriction by Noncontraction.Elia Zardini - 2016 - Notre Dame Journal of Formal Logic 57 (2):287-327.
Meeting Strength in Substructural Logics.Y. Venema - 1995 - Studia Logica 54 (1):3-32.
Can the Classical Logician Avoid the Revenge Paradoxes?Andrew Bacon - 2015 - Philosophical Review 124 (3):299-352.
Meeting Strength in Substructural Logics.Yde Venema - 1995 - Studia Logica 54 (1):3 - 32.
Logical Consequence and the Paradoxes.Edwin Mares & Francesco Paoli - 2014 - Journal of Philosophical Logic 43 (2-3):439-469.

Analytics

Added to PP index
2018-10-03

Total downloads
41 ( #157,289 of 2,293,868 )

Recent downloads (6 months)
41 ( #9,635 of 2,293,868 )

How can I increase my downloads?

Monthly downloads

My notes

Sign in to use this feature