Paraconsistent Modal Logics | Zendy

Umberto Rivieccio | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Paraconsistent Modal Logics

Author(s) -

Umberto Rivieccio

Publication year - 2011

Publication title -

electronic notes in theoretical computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.242

H-Index - 60

ISSN - 1571-0661

DOI - 10.1016/j.entcs.2011.10.014

Subject(s) - algebraic semantics , algebra over a field , modal logic , mathematics , modal , normal modal logic , completeness (order theory) , dynamic logic (digital electronics) , algebraic number , łukasiewicz logic , s5 , generalization , multimodal logic , representation (politics) , discrete mathematics , pure mathematics , computer science , theoretical computer science , substructural logic , description logic , mathematical analysis , transistor , voltage , law , chemistry , quantum mechanics , political science , physics , politics , polymer chemistry

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

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research