Reaching Classicality through Transitive Closure
Open Access
- 1 October 2025
- journal article
- Published by Uniwersytet Mikolaja Kopernika/Nicolaus Copernicus University in Logic and Logical Philosophy
- p. 1-27
Abstract
Recently, Da Ré, Szmuc, Chemla and Égré (2024) showed that all logics based on Boolean Normal monotonic three-valued schemes coincide with classical logic when defined using a strict-tolerant standard (st). Conversely, they proved that under a tolerant-strict standard (ts), the resulting logics are all empty. Building on these results, we show that classical logic can be obtained by closing under transitivity the union of two logics defined over (potentially different) Boolean normal monotonic schemes, using a strict-strict standard (ss) for one and a tolerant-tolerant standard (tt) for the other, with the first of these logics being paracomplete and the other being paraconsistent. We then identify a notion dual to transitivity that allows us to characterize the logic TS as the dual transitive closure of the intersection of any two logics defined over (potentially different) Boolean normal monotonic schemes, using an ss standard for one and a tt standard for the other. Finally, we expand on the abstract relations between the transitive closure and dual transitive closure operations, showing that they give rise to lattice operations that precisely capture how the logics discussed relate to one another.Keywords
All Related Versions
This publication has 24 references indexed in Scilit:
- $\textsf{ST}$ and $\textsf{TS}$ as Product and SumJournal of Philosophical Logic, 2024
- Metainferential Logics2023
- Monstrous Content and the Bounds of DiscourseJournal of Philosophical Logic, 2022
- THE LATTICE OF SUPER-BELNAP LOGICSThe Review of Symbolic Logic, 2021
- On All Strong Kleene Generalizations of Classical LogicStudia Logica, 2016
- CONSERVATIVELY EXTENDING CLASSICAL LOGIC WITH TRANSPARENT TRUTHThe Review of Symbolic Logic, 2012
- Tolerant, Classical, StrictJournal of Philosophical Logic, 2010
- A truth-conditional formulation of Karttunen's account of presuppositionSynthese, 1979
- The logic of paradoxJournal of Philosophical Logic, 1979
- A Kripke-style semantics for R-Mingle using a binary accessibility relationStudia Logica, 1976