Paraconsistency and Consistency Understood as the Absence of the Negation of any Implicative Theorem
Languages of publication
As is stated in its title, in this paper consistency is understood as the absence of the negation of any implicative theorem. Then, a series of logics adequate to this concept of consistency is defined within the context of the ternary relational semantics with a set of designated points, negation being modelled with the Routley operator. Soundness and completeness theorems are provided for each one of these logics. In some cases, strong (i.e., in respect of deducibility) soundness and completeness theorems are also proven. All logics in this paper are included in Lewis’ S4. They are all paraconsistent, but none of them is relevant.
07 - 07 - 2015
Publication order reference