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
01 Jun 2001
TL;DR: A framework which is called subjective logic uses elements from the Dempster-Shafer belief theory and it is shown that it is compatible with binary logic and probability calculus.
Abstract: We first describe a metric for uncertain probabilities called opinion, and subsequently a set of logical operators that can be used for logical reasoning with uncertain propositions. This framework which is called subjective logic uses elements from the Dempster-Shafer belief theory and we show that it is compatible with binary logic and probability calculus.

45 citations

Journal ArticleDOI
TL;DR: It is argued that the logic of requirements is exactly what the authors need in order to make sense of, and buttress, a constructionist (poietic) approach to knowledge.
Abstract: In this article, I outline a logic of design of a system as a specific kind of conceptual logic of the design of the model of a system, that is, the blueprint that provides information about the system to be created. In section two, I introduce the method of levels of abstraction as a modelling tool borrowed from computer science. In section three, I use this method to clarify two main conceptual logics of information (i.e., modelling systems) inherited from modernity: Kant's transcendental logic of conditions of possibility of a system, and Hegel's dialectical logic of conditions of in/stability of a system. Both conceptual logics of information analyse structural properties of given systems. Strictly speaking, neither is a conceptual logic of information about (or modelling) the conditions of feasibility of a system, that is, neither is a logic of information as a logic of design. So, in section four, I outline this third conceptual logic of information and then interpret the conceptual logic of design as a logic of requirements, by introducing the relation of "sufficientisation". In the conclusion, I argue that the logic of requirements is exactly what we need in order to make sense of, and buttress, a constructionist (poietic) approach to knowledge.

44 citations

Proceedings Article
24 Aug 1991
TL;DR: This work proposes two computational logics based on the notions of support and acceptance handling contradictions in a conservative, resp.
Abstract: In the logical semantics of knowledge bases (K8) the handling of contradictions poses a problem not solvable by standard logic. An adequate logic for KBs must be capable of tolerating inconsistency in a KB without losing its deductive content. This is also the bottom line of so-called paraconsistent logics. But paraconsistent logic does not address the question whether contradictory information should be accepted or not in the derivation of further information depending on it. We propose two computational logics based on the notions of support and acceptance handling contradictions in a conservative, resp. skeptical, manner: they neither lead to the break-down of the system nor are they accepted as valid pieces of information.

44 citations

Journal ArticleDOI
TL;DR: It is shown that this logic, once it is adequately understood, is weaker than classical logic, in a way similar to the paraconsistent logic LP.
Abstract: Adding a transparent truth predicate to a language completely governed by classical logic is not possible. The trouble, as is well-known, comes from paradoxes such as the Liar and Curry. Recently, Cobreros, Egre, Ripley and van Rooij have put forward an approach based on a non-transitive notion of consequence which is suitable to deal with semantic paradoxes while having a transparent truth predicate together with classical logic. Nevertheless, there are some interesting issues concerning the set of metainferences validated by this logic. In this paper, we show that this logic, once it is adequately understood, is weaker than classical logic. Moreover, the logic is in a way similar to the paraconsistent logic LP.

44 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