Open AccessRelational Semantics for the Paraconsistent and Paracomplete 4-valued Logic PŁ4
Author(s) -
Gemma Robles,
Sandra M. López,
José Miguel Arias Blanco
Publication year - 2022
Publication title -
logic and logical philosophy
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.416
H-Index - 10
eISSN - 2300-9802
pISSN - 1425-3305
DOI - 10.12775/llp.2022.016
Subject(s) - semantics (computer science) , paraconsistent logic , set (abstract data type) , computer science , mathematics , programming language , discrete mathematics , theoretical computer science , algebra over a field , higher order logic , description logic , pure mathematics
The paraconsistent and paracomplete 4-valued logic PŁ4 is originally interpreted with a two-valued Belnap-Dunn semantics. In the present paper, PŁ4 is endowed with both a ternary Routley-Meyer semantics and a binary Routley semantics together with their respective restriction to the 2 set-up cases.