Topic
Paraconsistent logic
About: Paraconsistent logic is a research topic. Over the lifetime, 1610 publications have been published within this topic receiving 28842 citations.
Papers published on a yearly basis
Papers
More filters
01 Jan 2002
TL;DR: In this paper, Molière states: "Quand je dis "Nicole, apportez-moi mes pantoufles, and me donnez mon bonnet de nuit ", c'est de la prose? Par ma foi!
Abstract: * Quoi? quand je dis " Nicole, apportez-moi mes pantoufles, et me donnez mon bonnet de nuit " , c'est de la prose? Par ma foi! Il y a plus de quarante ans que je dis de la prose sans que j'en susse rien, et je vous suisle plus obligé du monde de m'avoir appris cela. Molière, Le bourgeois gentilhomme
54 citations
04 Jul 1994
TL;DR: This paper develops proof systems which correspond to bilattice in an essential way and shows how to use those bilattices for efficient inferences from possibly inconsistent data.
Abstract: The notion of a bilattice was first proposed by Ginsberg (1988) as a general framework for many applications. This notion was further investigated and applied for various goals by Fitting (1989, 1990, 1991, 1993). In this paper, we develop proof systems which correspond to bilattices in an essential way. We then show how to use those bilattices for efficient inferences from possibly inconsistent data. For this, we incorporate certain ideas of Kifer and Lozinskii (1992) concerning inconsistencies, which happen to well suit the framework of bilattices. The outcome is a paraconsistent logic with many desirable properties. >
54 citations
TL;DR: The paper reviews a number of approaches for handling restricted quantification in relevant logic, and proposes a novel one by introducing a novel kind of enthymematic conditional.
Abstract: The paper reviews a number of approaches for handling restricted quantification in relevant logic, and proposes a novel one. This proceeds by introducing a novel kind of enthymematic conditional.
54 citations
TL;DR: In this article, the authors provide a theoretical framework that allows the direct search for natural deduction proofs in some non-classical logics, namely, intuitionistic sentential and predicate logic, but also in the modal logic S4.
Abstract: We provide a theoretical framework that allows the direct search for natural deduction proofs in some non-classical logics, namely, intuitionistic sentential and predicate logic, but also in the modal logic S4. The framework uses so-called intercalation calculi to build up broad search spaces from which normal proofs can be extracted, if a proof exists at all. This claim is supported by completeness proofs establishing in a purely semantic way normal form theorems for the above logics. Logical restrictions on the search spaces are briefly discussed in the last section together with some heuristics for structuring a more efficient search. Our paper is a companion piece to [15], where classical logic was treated.
53 citations