Asset Details
MbrlCatalogueTitleDetail
Do you wish to reserve the book?
Classical Logic and the Strict Tolerant Hierarchy
by
Scambler, Chris
in
Education
/ Logic
/ Philosophy
/ Truth
/ Validity
/ Valuation
2020
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
You are currently in the queue to collect this book. You will be notified once it is your turn to collect the book.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
Oops! Something went wrong.
While trying to remove the title from your shelf something went wrong :( Kindly try again later!
Do you wish to request the book?
Classical Logic and the Strict Tolerant Hierarchy
by
Scambler, Chris
in
Education
/ Logic
/ Philosophy
/ Truth
/ Validity
/ Valuation
2020
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Journal Article
Classical Logic and the Strict Tolerant Hierarchy
2020
Request Book From Autostore
and Choose the Collection Method
Overview
In their recent article “A Hierarchy of Classical and Paraconsistent Logics”, Eduardo Barrio, Federico Pailos and Damien Szmuc (BPS hereafter) present novel and striking results about meta-inferential validity in various three valued logics. In the process, they have thrown open the door to a hitherto unrecognized domain of non-classical logics with surprising intrinsic properties, as well as subtle and interesting relations to various familiar logics, including classical logic. One such result is that, for each natural number
n
, there is a logic which agrees with classical logic on tautologies, inferences, meta-inferences, meta-meta-inferences, meta-meta-...(
n
- 3 times)-meta-inferences, but that disagrees with classical logic on
n
+ 1-meta-inferences. They suggest that this shows that classical logic can only be characterized by defining its valid inferences at all orders. In this article, I invoke some simple symmetric generalizations of BPS’s results to show that the problem is worse than they suggest, since in fact there are logics that agree with classical logic on inferential validity to all orders but still intuitively differ from it. I then discuss the relevance of these results for truth theory and the classification problem.
This website uses cookies to ensure you get the best experience on our website.