.png){kind=icon}
.png){kind=icon}
Return
Reaching Classicality through Transitive Closure
.png){kind=icon}
OA
AI
DOI：10.12775/LLP.2025.019.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Recently, Da Re, Szmuc, Chemla and & Eacute;gr & eacute; (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:
three-valued logics
transitive closure
non-classical logics
strict-tolerant logic
logic of paradox
Strong Kleene logic
Weak Kleene logic
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
L
IF:
0.4
Papers:
21
Citations:
0