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.

Other Versions

No versions found

Links

PhilArchive

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Analytics

Added to PP
2024-01-25

Downloads
416 (#75,612)

6 months
267 (#11,016)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Umberto Rivieccio
Universidad Nacional de Educación a Distancia

Citations of this work

Nelson’s logic ????Thiago Nascimento, Umberto Rivieccio, João Marcos & Matthew Spinks - 2020 - Logic Journal of the IGPL 28 (6):1182-1206.

Add more citations

References found in this work

An algebraic approach to non-classical logics.Helena Rasiowa - 1974 - Warszawa,: PWN - Polish Scientific Publishers.
Algebraizable Logics.W. J. Blok & Don Pigozzi - 2022 - Advanced Reasoning Forum.
Foundations of mathematical logic.Haskell Brooks Curry - 1963 - New York: Dover Publications.
How a computer should think.Nuel Belnap - 1977 - In Gilbert Ryle, Contemporary aspects of philosophy. Boston: Oriel Press.
Constructible falsity and inexact predicates.Ahmad Almukdad & David Nelson - 1984 - Journal of Symbolic Logic 49 (1):231-233.

View all 10 references / Add more references