The authors of Beziau and Franceschetto work with logics that have the property of not satisfying any of the formulations of the principle of non contradiction, Béziau and Franceschetto also analyze, among the three-valued logics, which of these logics satisfy this property. They prove that there exist only four of such logics, but only two of them are worthwhile to study. The language of these logics does not consider implication as a connective. However, the enrichment of a language with an (...) implication connective leads us to more interesting systems, therefore we look for one implication for these logics and we study further properties that the logics obtain when this connective is added to these systems. (shrink)

In 2016, Béziau introduces a restricted notion of paraconsistency, the so-called genuine paraconsistency. A logic is genuine paraconsistent if it rejects the laws $\varphi,\neg \varphi \vdash \psi$ and $\vdash \neg (\varphi \wedge \neg \varphi)$. In that paper, the author analyzes, among the three-valued logics, which of them satisfy this property. If we consider multiple-conclusion consequence relations, the dual properties of those above-mentioned are $\vdash \varphi, \neg \varphi$ and $\neg (\varphi \vee \neg \varphi) \vdash$. We call genuine paracomplete logics those rejecting (...) the mentioned properties. We present here an analysis of the three-valued genuine paracomplete logics. A very natural twist structures semantics for these logics is also found in a systematic way. This semantics produces automatically a simple and elegant Hilbert-style characterization for all these logics. Finally, we introduce the logic LGP which is genuine paracomplete is not genuine paraconsistent, not even paraconsistent and cannot be characterized by a single finite logical matrix. (shrink)

Genuine Paraconsistent logics \ and \ were defined in 2016 by Béziau et al, including only three logical connectives, namely, negation disjunction and conjunction. Afterwards in 2017 Hernández-Tello et al, provide implications for both logics and define the logics \ and \. In this work we continue the study of these logics, providing sound and complete Hilbert-type axiomatic systems for each logic. We prove among other properties that \ and \ satisfy a restricted version of the Substitution Theorem, and that (...) both of them are maximal with respect to Classical Propositional Logic. To conclude we make some comparisons between \ and \ and among other logics, for instance \ and some \s. (shrink)

In memoriam José Arrazola Ramírez The logic $\textbf{G}^{\prime}_3$ was introduced by Osorio et al. in 2008; it is a three-valued logic, closely related to the paraconsistent logic $\textbf{CG}^{\prime}_3$ introduced by Osorio et al. in 2014. The logic $\textbf{CG}^{\prime}_3$ is defined in terms of a multi-valued semantics and has the property that each theorem in $\textbf{G}^{\prime}_3$ is a theorem in $\textbf{CG}^{\prime}_3$. Kripke-type semantics has been given to $\textbf{CG}^{\prime}_3$ in two different ways by Borja et al. in 2016. In this work, we (...) continue the study of $\textbf{CG}^{\prime}_3$, obtaining a Hilbert-type axiomatic system and proving a soundness and completeness theorem for this logic. (shrink)