Paraconsistent logic

About: Paraconsistent logic is a research topic. Over the lifetime, 1610 publications have been published within this topic receiving 28842 citations.

From Deontic Logic to the Genuine Logic of Norms

Abstract: Undoubtedly it was the intention of the creators of deontic logic to produce a theory of sentence structures and of logical operations which was to be applied as an instrument for the regulation of thinking and rational argumentation in the normative disciplines (ethics, jurisprudence, etc.). That this was the task envisioned is clear and undisputed; whether and to what extent this task was accomplished will have to be examined. This critical examination of deontic logic will have to be carried out on two levels: on the level of the philosophical preconditions, and on the level of the applicability of deontic logic as logic of the normative fields.

Railway Signal and Paraconsistency

Abstract: In this paper, we propose a complete lattice structure that expresses a paraconsistent view for railway signal knowledge. In the complete lattice, the meanings of the railway signal information regarding to railway interlocking are denoted well. Also, we have introduce a simulation system in which a paraconsistent logic program EVALPSN (Extended Vector Annotated Logic Program with Strong Negation) based on the railway signal lattice is used to express interlocking information.

Reflections on “difficult” embeddings

Abstract: The main purpose of this note is to present “difficult” embeddings of minimal and full intuitionistic logic into classical linear logic, and to prove their soundness and faithfulness. Moreover, it is also pointed out that Girard's translation of intuitionistic logic into classical linear logic is provably equivalent to one of the translations considered in this paper.

Combining intuitionistic logic with paraconsistent operators

Abstract: A new propositional intuitionistic paraconsistent logic, IL?, is introduced as a sequent calculus combining Gentzen’s LJ with paraconsistent negation-like and involution-like operators Completeness theorem with respect to Kripke semantics, embedding theorem into LJ, cut-elimination theorem and decidability theorem are shown for IL?

An inconsistency-adaptive proof procedure for logic programming

Abstract: It is the goal of this paper to define a paraconsistent proof procedure that has the best of two mechanisms, in casu logic programming and inconsistency-adaptive logics. From logic programming we will maintain the ease of computing, and from adaptive logics their paraconsistency, dynamics and non-monotonicity. This will be done by combining the notion of competitor from logic programming with the conditionallity that is common in all adaptive proofs.