In Can Başkent & Thomas Macaulay Ferguson (eds.), Graham Priest on Dialetheism and Paraconsistency. Springer Verlag. pp. 165-187 (2019)

Abilio Rodrigues
Federal University of Minas Gerais
Walter Carnielli
University of Campinas
Proof-theoretic semantics provides meanings to the connectives of intuitionistic logic without the need for a semantics in the standard sense of an attribution of semantic values to formulas. Meanings are given by the inference rules that, in this case, do not express preservation of truth but rather preservation of availability of a constructive proof. Elsewhere we presented two paraconsistent systems of natural deduction: the Basic Logic of Evidence and the Logic of Evidence and Truth. The rules of BLE have been conceived to preserve a notion weaker than truth, namely, evidence, understood as reasons for believing in or accepting a given proposition. \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$LET_{J}$$\end{document}, on the other hand, is a logic of formal inconsistency and undeterminedness that extends \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$BLE$$\end{document} by adding resources to recover classical logic for formulas taken as true, or false. We extend the idea of proof-theoretic semantics to these logics and argue that the meanings of the connectives in BLE are given by the fact that its rules are concerned with preservation of the availability of evidence. An analogous idea also applies to \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$LET_{J}$$\end{document}.
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.1007/978-3-030-25365-3_9
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

Our Archive

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 50,488
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

No references found.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

A Remark on Hereditarily Nonparadoxical Sets.Péter Komjáth - 2016 - Archive for Mathematical Logic 55 (1-2):165-175.
Models of Weak Theories of Truth.Mateusz Łełyk & Bartosz Wcisło - 2017 - Archive for Mathematical Logic 56 (5-6):453-474.
Cofinality of the Laver Ideal.Miroslav Repický - 2016 - Archive for Mathematical Logic 55 (7-8):1025-1036.
$$I_0$$ I 0 and Combinatorics at $$\Lambda ^+$$ Λ +.Nam Trang & Xianghui Shi - 2017 - Archive for Mathematical Logic 56 (1-2):131-154.
Isomorphic and Strongly Connected Components.Miloš S. Kurilić - 2015 - Archive for Mathematical Logic 54 (1-2):35-48.
Minimal Elementary End Extensions.James H. Schmerl - 2017 - Archive for Mathematical Logic 56 (5-6):541-553.
Set Theory Without Choice: Not Everything on Cofinality is Possible.Saharon Shelah - 1997 - Archive for Mathematical Logic 36 (2):81-125.
Square Principles with Tail-End Agreement.William Chen & Itay Neeman - 2015 - Archive for Mathematical Logic 54 (3-4):439-452.
Some Properties of R-Maximal Sets and Q 1,N -Reducibility.R. Sh Omanadze - 2015 - Archive for Mathematical Logic 54 (7-8):941-959.


Added to PP index

Total views
4 ( #1,167,297 of 2,326,758 )

Recent downloads (6 months)
4 ( #209,916 of 2,326,758 )

How can I increase my downloads?


My notes