Article ID Journal Published Year Pages File Type
421801 Electronic Notes in Theoretical Computer Science 2011 14 Pages PDF
Abstract

We introduce a modal expansion of paraconsistent Nelson logic that is also as a generalization of the Belnapian modal logic recently introduced by Odintsov and Wansing. We prove algebraic completeness theorems for both logics, defining and axiomatizing the corresponding algebraic semantics. We provide a representation for these algebras in terms of twist-structures, generalizing a known result on the representation of the algebraic counterpart of paraconsistent Nelson logic.

Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics