DeepAI AI Chat
Log In Sign Up

A Logic for Paraconsistent Transition Systems

by   Ana Cruz, et al.

Modelling complex information systems often entails the need for dealing with scenarios of inconsistency in which several requirements either reinforce or contradict each other. In this kind of scenarios, arising e.g. in knowledge representation, simulation of biological systems, or quantum computation, inconsistency has to be addressed in a precise and controlled way. This paper generalises Belnap-Dunn four-valued logic, introducing paraconsistent transition systems (PTS), endowed with positive and negative accessibility relations, and a metric space over the lattice of truth values, and their modal logic.


page 1

page 2

page 3

page 4


Quantum Computational Psychoanalysis – Quantum logic approach to Bi-logic

In this paper, we are dealing with the fundamental concepts of Bi-logic ...

From Hybrid Modal Logic to Matching Logic and back

Building on our previous work on hybrid polyadic modal logic we identify...

Bisimulation Invariant Monadic-Second Order Logic in the Finite

We consider bisimulation-invariant monadic second-order logic over vario...

On Coalgebraic Many-Valued Modal Logic

In this paper, we investigate the many-valued version of coalgebraic mod...

A van Benthem Theorem for Quantitative Probabilistic Modal Logic

In probabilistic transition systems, behavioural metrics provide a more ...

Compressed Constraints in Probabilistic Logic and Their Revision

In probabilistic logic entailments, even moderate size problems can yiel...