| Full text | |
| Author(s): |
Coniglio, Marcelo E.
;
Figallo, Martin
;
Rodrigues, Abilio
Total Authors: 3
|
| Document type: | Journal article |
| Source: | JOURNAL OF LOGIC AND COMPUTATION; v. N/A, p. 24-pg., 2024-12-20. |
| Abstract | |
In this paper, we investigate proof-theoretic aspects of the logics of evidence and truth $LET_{J}$ and $LET_{F}$. These logics extend, respectively, Nelson's logic N4 and the logic of first-degree entailment, also known as Belnap-Dunn four-valued logic, with a classicality operator ${{\circ }}$ that recovers classical logic for formulas in its scope. We will present natural deduction and sequent systems for $LET_{J}$ and $LET_{F}$, together with proofs of normalization and cut-elimination theorems, respectively. As a corollary, we obtain decision procedures, which guarantees bottom-up proof search for both logics. (AU) | |
| FAPESP's process: | 20/16353-3 - Rationality, logic, and probability: RatioLog |
| Grantee: | Marcelo Esteban Coniglio |
| Support Opportunities: | Research Projects - Thematic Grants |
| FAPESP's process: | 22/03862-2 - Proof-theoretical methods for LFIs and other non-classical logics: decidability and applications |
| Grantee: | Marcelo Esteban Coniglio |
| Support Opportunities: | Research Grants - Visiting Researcher Grant - International |