Skip to main content
Log in

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

  • S.I.: Varieties of Entailment
  • Published:
Synthese Aims and scope Submit manuscript

Abstract

This paper is devoted to a consequence relation combining the negation of Classical Logic (\(\mathbf {CL}\)) and a paraconsistent negation based on Graham Priest’s Logic of Paradox (\(\mathbf {LP}\)). We give a number of natural desiderata for a logic \(\mathbf {L}\) 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 \(\mathbf {CLP}\) 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 \(\mathbf {CLP}\) 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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2

Similar content being viewed by others

Notes

  1. \(\mathbf {FDE}\) is the four-valued logic named ‘First Degree Entailment’ first proposed by Belnap and Dunn in Belnap (1977), also called Belnap–Dunn logic.

  2. A set of formulas is trivial iff it contains all well-formed formulas of the language.

  3. A formula or set of formulas is meaningful iff there is a non-trivial interpretation for it.

  4. For now this is vague language which will be made more precise in Req1 on p. 14.

  5. The Equivalence Rules says that a formula is equivalent to the formula resulting from substituting a subformula of the original formula by one that is equivalent to it.

  6. This holds for all formulas, no specific clause for sentential letters is needed.

  7. To see that \(\mathrm {\sim }A\nvDash _\mathbf {CLP} \lnot A\), observe that nothing prohibits the existence of a model M for which \(M\models \mathrm {\sim }p\), \(M\models p\) and \(M\not \models \lnot p\), as it is in accordance with IS5 and IS6.

  8. In the equation we use the subtraction symbol “−” both for the subtraction of numbers and as for the subtraction of sets.

  9. This can be proven by showing that \(\varGamma \vdash _\mathbf {CLP'} B\) iff \(\varGamma \cup \{\lnot (\Box ^i A \wedge \mathrm {\sim }\Box ^i A)\mid A\in \mathcal {S}, i\in \mathbb {N}\} \vdash _\mathbf {CLP} B\), using Theorem 1.

  10. Of course, one can easily devise many other paraconsistent logics where inconsistencies come in degrees (e.g. paraconsistent fuzzy logics), but here the degrees are the result of doing nothing but adding classical negation to a standard paraconsistent logic in such a way that the resulting logic preserves as many features as possible of the combined logics.

References

  • Batens, D. (2007). A universal logic approach to adaptive logics. Logica Universalis, 1, 221–242.

    Article  Google Scholar 

  • Batens, D., & De Clercq, K. (2005). A rich paraconsistent extension of full positive logic. Logique et Analyse, 185–188, 227–257. (Appeared 2005).

    Google Scholar 

  • Belnap, N. D. (1977). A useful four-valued logic. In J. M. Dunn & G. Epstein (Eds.), Modern uses of multiple-valued logic. Dordrecht: D. Reidel.

    Google Scholar 

  • Blasio, C. (2017). Revisitando a lógica de dunn-belnap. Manuscrito, 40(2), 99–126.

    Article  Google Scholar 

  • Blasio, C., Marcos, J., & Wansing, H. (2017). An inferentially many-valued two-dimensional notion of entailment. Bulletin of the Section of Logic, 46(3–4), 233–262.

    Google Scholar 

  • Carnielli, W. A., Coniglio, M. E., & Marcos, J. (2007). Logics of formal inconsistency. In D. Gabbay & F. Guenthner (Eds.), Handbook of philosophical logic (Vol. 14, pp. 1–93). Berlin: Springer.

    Google Scholar 

  • Meyer, R. K., & Routley, R. (1974). Classical relevant logics ii. Studia Logica, 33(2), 183–194. https://doi.org/10.1007/BF02120493.

    Article  Google Scholar 

  • Priest, G. (1979). The logic of paradox. Journal of Philosophical Logic, 8, 219–241.

    Article  Google Scholar 

  • Putte, F. V. D., & Straßer, C. (2012). Extending the standard format of adaptive logics to the prioritized case. Logique Et Analyse, 120, 601–641.

    Google Scholar 

  • Zadeh, L. (1965). Fuzzy sets. Information Control, 8, 338–353.

    Article  Google Scholar 

Download references

Acknowledgements

I would like to thank the two reviewers of this paper and the two reviewers of an unpublished submission of an early version of this paper to another journal for their invaluable remarks, corrections, criticisms and suggestions.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Peter Verdée.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Verdée, P. Obtaining infinitely many degrees of inconsistency by adding a strictly paraconsistent negation to classical logic. Synthese 198 (Suppl 22), 5415–5449 (2021). https://doi.org/10.1007/s11229-020-02638-8

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11229-020-02638-8

Keywords

Navigation