2024/12/13 by Walter Carnielli, Carnielli, Walter, Lorenzzo Frade +3
Computer Science · #FOS: Mathematics #History and Overview (math.HO) #Logic (math.LO) #Seismology and Earthquake Studies
paper · pdf · doi:10.48550/arxiv.2412.10588
openalex publication_date 2024/12/13 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/01
This paper presents a sound, complete, and decidable analytic tableau system for the logic of evidence and truth \letf, introduced in Rodrigues, Bueno-Soler & Carnielli (Synthese, DOI: 10.1007/s11229-020-02571-w, 2020). \letf is an extension of the logic of first-degree entailment (\fde), also known as Belnap-Dunn logic. \fde is a widely studied four-valued paraconsistent logic, with applications in computer science and in the algebra of processes. \letf extends \fde in a very natural way, by adding a classicality operator \cons, which recovers classical logic for propositions in its scope, and a non-classicality operator \incon, dual of \cons.