Obtaining infinitely many degrees of inconsistency by adding a strictly paraconsistent negation to classical logic

This paper is devoted to a consequence relation combining the negation of Classical Logic (CL\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathbf {CL}$$\end{document}) and a paraconsistent negation based on Graham Priest’s Logic of Paradox (LP\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathbf {LP}$$\end{document}). We give a number of natural desiderata for a logic L\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathbf {L}$$\end{document} that combines both negations. They are motivated by a particular property-theoretic perspective on paraconsistency and are all about warranting that the combining logic has the same characteristics as the combined logics, without giving up on the radically paraconsistent nature of the paraconsistent negation. We devise the logic CLP\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathbf {CLP}$$\end{document} by means of an axiomatization and three equivalent semantical characterizations (a non-deterministic semantics, an infinite-valued set-theoretic semantics and an infinite-valued semantics with integer numbers as values). By showing that this logic is maximally paraconsistent, we prove that CLP\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathbf {CLP}$$\end{document} is the only logic satisfying all postulated desiderata. Finally we show how the logic’s infinite-valued semantics permits defining different types of entailment relations.