A fully classical truth theory characterized by substructural means

Review of Symbolic Logic 13 (2):249-268 (2020)
  Copy   BIBTEX

Abstract

We will present a three-valued consequence relation for metainferences, called CM, defined through ST and TS, two well known substructural consequence relations for inferences. While ST recovers every classically valid inference, it invalidates some classically valid metainferences. While CM works as ST at the inferential level, it also recovers every classically valid metainference. Moreover, CM can be safely expanded with a transparent truth predicate. Nevertheless, CM cannot recapture every classically valid meta-metainference. We will afterwards develop a hierarchy of consequence relations CMn for metainferences of level n. Each CMn recovers every metainference of level n or less, and can be nontrivially expanded with a transparent truth predicate, but cannot recapture every classically valid metainferences of higher levels. Finally, we will present a logic CMω, based on the hierarchy of logics CMn, that is fully classical, in the sense that every classically valid metainference of any level is valid in it. Moreover, CMω can be nontrivially expanded with a transparent truth predicate.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,682

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Comparing Substructural Theories of Truth.David Ripley - 2015 - Ergo: An Open Access Journal of Philosophy 2.
Substructural epistemic logics.Igor Sedlár - 2015 - Journal of Applied Non-Classical Logics 25 (3):256-285.
Naïve validity.Julien Murzi & Lorenzo Rossi - 2017 - Synthese 199 (Suppl 3):819-841.
Glivenko theorems revisited.Hiroakira Ono - 2010 - Annals of Pure and Applied Logic 161 (2):246-250.
Restriction by Noncontraction.Elia Zardini - 2016 - Notre Dame Journal of Formal Logic 57 (2):287-327.
An Algebraic Approach to the Disjunction Property of Substructural Logics.Daisuke Souma - 2007 - Notre Dame Journal of Formal Logic 48 (4):489-495.
LP, K3, and FDE as Substructural Logics.Lionel Shapiro - 2017 - In Pavel Arazim & Tomáš Lavička (eds.), The Logica Yearbook 2016. London: College Publications.
A Sahlqvist theorem for substructural logic.Tomoyuki Suzuki - 2013 - Review of Symbolic Logic 6 (2):229-253.
Noisy vs. Merely Equivocal Logics.Patrick Allo - 2013 - In Francesco Berto, Edwin Mares, Koji Tanaka & Francesco Paoli (eds.), Paraconsistency: Logic and Applications. Springer. pp. 57--79.
Models for Substructural Arithmetics.Greg Restall - 2011 - Australasian Journal of Logic 8:82-99.

Analytics

Added to PP
2019-01-06

Downloads
68 (#243,933)

6 months
21 (#133,651)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Federico Pailos
Universidad de Buenos Aires (UBA)

Citations of this work

Classical Logic and the Strict Tolerant Hierarchy.Chris Scambler - 2020 - Journal of Philosophical Logic 49 (2):351-370.
One Step is Enough.David Ripley - 2021 - Journal of Philosophical Logic 51 (6):1-27.
Supervaluations and the Strict-Tolerant Hierarchy.Brian Porter - 2021 - Journal of Philosophical Logic 51 (6):1367-1386.

View all 18 citations / Add more citations

References found in this work

Outline of a theory of truth.Saul 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 21 references / Add more references