Skip to main content
Log in

A Non-deterministic View on Non-classical Negations

Studia Logica Aims and scope Submit manuscript

Abstract

We investigate two large families of logics, differing from each other by the treatment of negation. The logics in one of them are obtained from the positive fragment of classical logic (with or without a propositional constant ff for “the false”) by adding various standard Gentzen-type rules for negation. The logics in the other family are similarly obtained from LJ+, the positive fragment of intuitionistic logic (again, with or without ff). For all the systems, we provide simple semantics which is based on non-deterministic four-valued or three-valued structures, and prove soundness and completeness for all of them. We show that the role of each rule is to reduce the degree of non-determinism in the corresponding systems. We also show that all the systems considered are decidable, and our semantics can be used for the corresponding decision procedures. Most of the extensions of LJ+ (with or without ff) are shown to be conservative over the underlying logic, and it is determined which of them are not.

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.

Institutional subscriptions

References

  1. ALMUKDAD, A., and D. NELSON, ‘Constructible falsity and inexact predicates’, Journal of Symbolic Logic, 49:231–333, 1984.

    Google Scholar 

  2. ARIELI, O., and A. AVRON, ‘Reasoning with logical bilattices’, Journal of Logic, Language and Information, 5(1):25–63, 1996.

    Google Scholar 

  3. ARIELI, O., and A. AVRON, ‘The value of four values’, Artificial Intelligence, 102(1):97–141, 1998.

    Article  Google Scholar 

  4. AVRON, A., ‘On an implication connective of RM’, Notre Dame Journal of Formal Logic, 27:201–209, 1986.

    Google Scholar 

  5. AVRON, A., ‘Natural 3-valued logics: Characterization and proof theory’, Journal of Symbolic Logic, 56(1):276–294, 1991.

    Google Scholar 

  6. AVRON, A., ‘Non-deterministic semantics for families of paraconsistent logics’, To appear in Proceedings 3rd World Congress on Paraconsistency (WCP03).

  7. AVRON, A., and I. LEV, ‘Non-deterministic matrices’, in Proc. of the Thirty-fourth International Symposium on Multiple-valued Logic (ISMVL 2004), pp. 282–287. IEEE Computer Society, 2004.

  8. AVRON, A., and I. LEV, ‘Canonical propositional Gentzen-type systems’, in R. Goré, A. Leitsch, and T. Nipkow, (eds.), Proc. of the 1st International Joint Conference on Automated Reasoning (IJCAR 2001), number 2083 in Lecture Notes in AI, pp. 529–544, Springer Verlag, 2001.

  9. AVRON, A., and I. LEV, ‘Non-deterministic Multiple-valued Structures’, To appear in the Journal of Logic and Computation

  10. BATENS, D., ‘Paraconsistent extensional propositional logics’, Logique et Analyse, 90–91:195–234, 1980.

    Google Scholar 

  11. BATENS, D., ‘A survey of inconsistency-adaptive logics'’, in D. Batens, C. Mortensen, G. Priest, and J. P. Van Bendegem, (eds.), Frontiers of Paraconsistent Logic, pp. 49–73, King's College Publications, Research Studies Press, Baldock, UK, 2000.

    Google Scholar 

  12. BATENS, D., K. DE CLERCQ, and N. KURTONINA, ‘Embedding and interpolation for some paralogics. The propositional case’, Reports on Mathematical Logic, 33:29–44, 1999.

    Article  Google Scholar 

  13. BELNAP, N. D., ‘How computers should think'’, in G. Ryle, (ed.), Contemporary Aspects of Philosophy, pp. 30–56, Oriel Press, Stocksfield, England, 1977.

    Google Scholar 

  14. BELNAP, N. D., ‘A useful four-valued logic’, in G. Epstein and J. M. Dunn, (eds.), Modern Uses of Multiple-Valued Logic, pp. 7–37, Reidel, Dordrecht, 1977.

    Google Scholar 

  15. CARNIELLI, W. A., ‘Possible-translations semantics for paraconsistent logics’, in D. Batens, C. Mortensen, G. Priest, and J. P. Van Bendegem, (eds.), Frontiers of Paraconsistent Logic, Studies in Logic and Computation, pp. 149–163, King's College Publications, Research Studies Press, 2000.

  16. CARNIELLI, W. A., and J. MARCOS, ‘Limits for paraconsistent calculi'’, Notre Dame Journal of Formal Logic, 40:375–390, 1999.

    Article  Google Scholar 

  17. CARNIELLI, W. A., and J. MARCOS, ‘A taxonomy of C-systems’, in W. A. Carnielli, M. E. Coniglio, and I. L. M. D'Ottaviano, (eds.), Paraconsistency—the logical way to the inconsistent, Lecture notes in pure and applied Mathematics, pp. 1–94, Marcell Dekker, 2002.

  18. CRAWFORD, J. M., and D. W. ETHERINGTON, ‘A non-deterministic semantics for tractable inference’, in Proc. of the 15th International Conference on Artificial Intelligence and the 10th Conference on Innovative Applications of Artificial Intelligence, pp. 286–291, MIT Press, Cambridge, 1998.

  19. DA COSTA, N. C. A., ‘On the theory of inconsistent formal systems’, Notre Dame Journal of Formal Logic, 15:497–510, 1974.

    Google Scholar 

  20. D'OTTAVIANO, I. L. M., and N. C. A. DA COSTA, ‘Sur un problème de Jaśkowski'’, Comptes Rendus de l'Academie de Sciences de Paris (A-B), (270):1349–1353, 1970.

    Google Scholar 

  21. D'OTTAVIANO, I. L. M., ‘The completeness and compactness of a three-valued first-order logic’, Revista Colombiana de Matematicas, XIX(1-2):31–42, 1985.

    Google Scholar 

  22. DUNN, J.M., ‘Intuitive semantics for first-degree entailments and coupled trees’, Philosophical Studies, 29:149–168, 1976.

    Article  Google Scholar 

  23. EPSTEIN, R. L., The semantic foundation of logic, volume I: propositional logics, chapter IX. Kluwer Academic Publisher, 1990.

  24. FITTING, M., ‘Bilattices in logic programming’, in G. Epstein, (ed.), Proc. of the 20th Int. Symp. on Multiple-Valued Logic, pp. 238–246, IEEE Press, 1990.

  25. FITTING, M., ‘Kleene's logic, generalized’, Journal of Logic and Computation, 1:797–810, 1990.

    Google Scholar 

  26. FITTING, M., ‘Bilattices and the semantics of logic programming’, Journal of Logic Programming, 11(2):91–116, 1991.

    Article  Google Scholar 

  27. FITTING, M., ‘Kleene's three-valued logics and their children’, Fundamenta Informaticae, 20:113–131, 1994.

    Google Scholar 

  28. GENTZEN, G., ‘Investigations into logical deduction’, in M. E. Szabo, (ed.), The Collected Works of Gerhard Gentzen, pp. 68–131, North Holland, Amsterdam, 1969.

    Google Scholar 

  29. GIRARD, J. Y., ‘Linear Logic'’, Theoretical Computer Science, 50:1–102, 1987.

    Article  Google Scholar 

  30. GINSBERG, M. L., ‘Multiple-valued logics’, in M. L. Ginsberg, (ed.), Readings in Non-Monotonic Reasoning, pp. 251–258, Los-Altos, CA, 1987.

  31. GINSBERG, M. L., ‘Multivalued logics: A uniform approach to reasoning in AI’, Computer Intelligence, 4:256–316, 1988.

    Google Scholar 

  32. JONES, C. B., Systematic Software Development Using VDM. Prentice-Hall International, U.K., 1986.

    Google Scholar 

  33. PEARCE, D., ‘From Here to There: Stable Negation in Logic Programming’, in D. M. Gabbay and H. Wansing, (eds.), What is Negation?, pp. 161–181, Kluwer Academic Publishers, 1999.

  34. RAGGIO, A. R., ‘Propositional sequence-calculi for inconsistent systems’, Notre Dame Journal of Formal Logic, 9:359–366, 1968.

    Google Scholar 

  35. ROZONER, L. I., ‘On interpretation of inconsistent theories’, Information Sciences, 47:243–266, 1989.

    Article  Google Scholar 

  36. SCHÜTTE, K., Beweistheorie. Springer, Berlin, 1960.

    Google Scholar 

  37. TAKEUTI, G., Proof Theory. American Elsevier Publishing Company, 1975.

  38. VON KUTSCHERA, F., ‘Ein verallgemeinerter widerlegungsbegriff fur Gentzenkalkule’, Archiv fur Mathematische Logik und Grundlagenforschung, 12:104–118, 1969.

    Article  Google Scholar 

  39. WANSING, H., The Logic of Information Structures, volume 681 of LNAI. Springer-Verlag, 1993.

  40. WANSING, H., ‘Negation'’, in L. Goble, (ed.), The Blackwell Guide to Philosophical Logic, pp. 415–436, Basil Blackwell Publishers, 2001.

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Arnon Avron.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Avron, A. A Non-deterministic View on Non-classical Negations. Stud Logica 80, 159–194 (2005). https://doi.org/10.1007/s11225-005-8468-5

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11225-005-8468-5

Keywords

Navigation