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 2008
TL;DR: In this article, axioms of parainconsistency as well as those of paraconsistent consequence have been introduced and their equivalence established, and the equivalence of paraconistent consequence has been established.
Abstract: In this paper axioms of parainconsistency as well as those of paraconsistent consequence have been introduced and their equivalence established.
2 citations
TL;DR: In this article, an ACP-style process algebra was proposed in which propositions are used as the visible part of the state of processes and as state conditions under which processes may proceed.
Abstract: In a previous paper, an ACP-style process algebra was proposed in which propositions are used as the visible part of the state of processes and as state conditions under which processes may proceed. This process algebra, called ACPps, is built on classical propositional logic. In this paper, we present a version of ACPps built on a paraconsistent propositional logic which is essentially the same as CLuNs. There are many systems that would have to deal with self-contradictory states if no special measures were taken. For a number of these systems, it is conceivable that accepting self-contradictory states and dealing with them in a way based on a paraconsistent logic is an alternative to taking special measures. The presented version of ACPps can be suited for the description and analysis of systems that deal with self-contradictory states in a way based on the above-mentioned paraconsistent logic.
2 citations
30 Jun 2018
TL;DR: This paper establishes a formal connection between a particular many–valued paraconsistent logic and the logic of a KDD method, namely the GUHA data mining method by introducing a new quantifier called Paraconsistent Separation quantifier, implemented to LISp–Miner Software.
Abstract: The primary aim of this paper is to establish a formal connection between a particular many–valued paraconsistent logic and the logic of a KDD method, namely the GUHA data mining method by introducing a new quantifier called Paraconsistent Separation quantifier. This quantifier is implemented to LISp–Miner Software. The secondary aim is to demonstrate a possible usefulness of this quantifier in social and other applied sciences by examples taking from family planning context.
2 citations
01 Jan 2015
2 citations
01 Jan 2013
TL;DR: It is uncovered a ‘naturally occurring’ first degree system, AL of Articular Logic that is both relevant and paraconsistent, and an informationally articulated, but nevertheless entirely classical representation of wffs as clutters on the power set of a set of possible states.
Abstract: We uncover a ‘naturally occurring’ first degree system, AL of Articular Logic that is both relevant and paraconsistent. The principal semantic innovation is an informationally articulated, but nevertheless entirely classical representation of wffs as clutters (Clutters are also referred to as simple hypergraphs in some contexts.) on the power set of a set of possible states. The principal methodological novelty is the general observation that distinct classical representations of wffs can be selected and combined with redeployments of classical inference to accommodate particular inferential requirements such as paraconsistency and relevance.
2 citations