Journal of Philosophical Logic:1-21 (forthcoming)
AbstractI show that it is not possible to uniquely characterize classical logic when working within classical set theory. By building on recent work by Eduardo Barrio, Federico Pailos, and Damian Szmuc, I show that for every inferential level, either classical logic is not unique at that level or there exist intuitively valid inferences of that level that are not definable in modern classical set theory. The classical logician is thereby faced with a three-horned dilemma: Give up uniqueness but preserve characterizability, give up characterizability and preserve uniqueness, or preserve both but give up modern classical set theory. After proving the main result, I briefly explore this third option by developing an account of classical logic within a paraconsistent set theory. This account of classical logic ensures unique characterizability in some sense, but the non-classical set theory also produces highly non-classical meta-results about classical logic.
Similar books and articles
Notes on Cardinals That Are Characterizable by a Complete (Scott) Sentence.Ioannis Souldatos - 2014 - Notre Dame Journal of Formal Logic 55 (4):533-551.
Possibilities, Models, and Intuitionistic Logic: Ian Rumfitt’s The Boundary Stones of Thought.Stewart Shapiro - 2019 - Inquiry: An Interdisciplinary Journal of Philosophy 62 (7):812-825.
Classical Negation Can Be Expressed by One of its Halves.J.-Y. Beziau - 1999 - Logic Journal of the IGPL 7 (2):145-151.
Classical Negation Can Be Expressed by One of its Halves.Jean-Yves Beziau - 1999 - Logic Journal of the IGPL 7 (2):145-151.
On the Non-Confluence of Cut-Elimination.Matthias Baaz & Stefan Hetzl - 2011 - Journal of Symbolic Logic 76 (1):313 - 340.
Quasi-Finitely Characterizable and Finitely Characterizable Dedekind Algebras.George Weaver & Benjamin George - 2002 - Bulletin of the Section of Logic 31 (2):145-157.
Non-Classical Metatheory for Non-Classical Logics.Andrew Bacon - 2013 - Journal of Philosophical Logic 42 (2):335-355.
Automated Correspondence Analysis for the Binary Extensions of the Logic of Paradox.Yaroslav Petrukhin & Vasily Shangin - 2017 - Review of Symbolic Logic 10 (4):756-781.
Classical Negation and Expansions of Belnap–Dunn Logic.Michael De & Hitoshi Omori - 2015 - Studia Logica 103 (4):825-851.
Computational Logic. Vol. 1: Classical Deductive Computing with Classical Logic. 2nd Ed.Luis M. Augusto - 2022 - London: College Publications.
Deduction, Ordering, and Operations in Quantum Logic.Normal D. Megill & Mladen Pavičić - 2002 - Foundations of Physics 32 (3):357-378.
Added to PP
Historical graph of downloads
References found in this work
A Hierarchy of Classical and Paraconsistent Logics.Eduardo Alejandro Barrio, Federico Pailos & Damian Szmuc - 2020 - Journal of Philosophical Logic 49 (1):93-120.
Classical Logic and the Strict Tolerant Hierarchy.Chris Scambler - 2020 - Journal of Philosophical Logic 49 (2):351-370.
ST, LP and Tolerant Metainferences.Bogdan Dicher & Francesco Paoli - 2019 - In Can Başkent & Thomas Macaulay Ferguson (eds.), Graham Priest on Dialetheism and Paraconsistency. Springer Verlag. pp. 383-407.