Paraconsistent modal logics

Electronic Notes in Theoretical Computer Science 278:173-186 (2011)
  Copy   BIBTEX

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 twiststructures, generalizing a known result on the representation of the algebraic counterpart of paraconsistent Nelson logic.

Author's Profile

Umberto Rivieccio
Universidad Nacional de EducaciĆ³n a Distancia

Analytics

Added to PP
2024-01-25

Downloads
58 (#92,008)

6 months
58 (#75,476)

Historical graph of downloads since first upload
This graph includes both downloads from PhilArchive and clicks on external links on PhilPapers.
How can I increase my downloads?