scispace - formally typeset
Search or ask a question
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
More filters
Book ChapterDOI
01 Jan 2021
TL;DR: In this article, the authors examine the R-Mingle logic and compare it to Anderson and Belnap's system R of relevant implication and to classical two-valued logic.
Abstract: Arnon Avron has written: “Dunn-McCall logic RM is by far the best understood and the most well-behaved in the family of logics developed by the school of Anderson and Belnap.” I agree. There is the famous saying: “Do not let the perfect become the enemy of the good.” I might say: “good enough.” In this spirit, I will examine the logic R-Mingle, exploring how (in the terminology of Avron) it is only a “semi-relevant logic” but still a paraconsistent logic. I shall discuss the history of RM, and compare RM to Anderson and Belnap’s system R of relevant implication and to classical two-valued logic. There is a “consumer’s guide,” evaluating these logics as “tools,” in the light of my recent work on “Humans as Rational Toolmaking Animals.”

4 citations

09 Jan 2018
TL;DR: A PAL2v is proposed to solve the contradictory ∕ inconsistent data information problem in the context of the Industry 4.0 as a decision learning approach for the CPSs.
Abstract: Regarding the global productive systems such as manufacturing industry (automotive, electronics, etc), they always have problems of contradictory ∕ inconsistent data information on their control systems. Even in service sector such as health care (eg. devices for health control), always there exist contradictory ∕ inconsistent data information to be considered for decision making. Therefore, in the context of the Industry 4.0, the contradictory ∕ inconsistent data information problem, certainly, happen into the Cyber-Physical Systems (CPSs). Inserted into the group of Non-Classical Logics, the Paraconsistent Annotated Logic with annotation of two values (PAL2v) presents conditions to compute contradictory signals without the conflict of information that invalidates the conclusions. Thus, this paper proposes a PAL2v to solve the contradictory ∕ inconsistent data information problem in the context of the Industry 4.0 as a decision learning approach for the CPSs. The findings of the two examples demonstrated that the experiments are really promising and the developed control systems based on PAL2v are suitable for the Industry 4.0 environment. Key words: Paraconsistent Logic Controller, Paraconsistent Logic with annotation of two values (PAL2v), Industry 4.0, Cyber-Physical Systems (CPS).

4 citations

Journal ArticleDOI
01 Jan 1992
TL;DR: The position taken in this essay is representative of an approach in which one assumes the correctness of classical methods excepting only the cases in which the premise set is (classically) inconsistent.
Abstract: "The best known approaches to "reasoning with inconsistent data" require a logical framework which is decidedly non-classical. An alternative is presented here, beginning with some motivation which has been surprised in the work of C.I. Lewis, which does not require ripping great swatches from the fabric of classical logic. In effect, the position taken in this essay is representative of an approach in which one assumes the correctness of classical methods excepting only the cases in which the premise set is (classically) inconsistent.

4 citations

Book ChapterDOI
TL;DR: This paper shows that the language obtained for the multiple-conclusionsed system differs from that for the single-conclusioned case, shows how hereditary Harrop formulae can be recovered, and investigates contraction-free fragments of the logic.
Abstract: A key property in the definition of logic programming languages is the completeness of goal-directed proofs. This concept originated in the study of logic programming languages for intuitionistic logic in the (single-conclusioned) sequent calculus LJ, but has subsequently been adapted to multiple-conclusioned systems such as those for linear logic. Given these developments, it seems interesting to investigate the notion of goal-directed proofs for a multiple-conclusioned sequent calculus for intuitionistic logic, in that this is a logic for which there are both single-conclusioned and multiple-conclusioned systems (although the latter are less well known). In this paper we show that the language obtained for the multiple-conclusioned system differs from that for the single-conclusioned case, show how hereditary Harrop formulae can be recovered, and investigate contraction-free fragments of the logic.

4 citations


Network Information
Related Topics (5)
Axiom
11K papers, 257.9K citations
80% related
Logic programming
11.1K papers, 274.2K citations
79% related
Metaphysics
14.8K papers, 235.4K citations
77% related
Philosophy of science
15.4K papers, 361.5K citations
77% related
Class (set theory)
17.4K papers, 242K citations
76% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202313
202255
202131
202036
201935
201847