A recovery operator for nontransitive approaches

Review of Symbolic Logic 13 (1):80-104 (2020)
Download Edit this record How to cite View on PhilPapers
Abstract
In some recent articles, Cobreros, Egré, Ripley, & 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 nontransitive 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 article 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 nontrivial naïve theories it is sufficient to formulate the corresponding self-referential sentences with suitable biconditionals. Nevertheless, a secondary aim of this article 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 article, 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 nontrivially achieved if self-reference is expressed through identities.
PhilPapers/Archive ID
BARARO-15
Upload history
First archival date: 2018-10-03
Latest version: 2 (2018-11-14)
View other versions
Added to PP index
2018-10-03

Total views
372 ( #17,971 of 2,454,488 )

Recent downloads (6 months)
20 ( #32,201 of 2,454,488 )

How can I increase my downloads?

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