Skip to main content
Log in

Some Useful 16-Valued Logics: How a Computer Network Should Think

  • Published:
Journal of Philosophical Logic Aims and scope Submit manuscript

Abstract

In Belnap’s useful 4-valued logic, the set 2={T,F} of classical truth values is generalized to the set 4=℘(2)={∅,{T},{F},{T,F}}. In the present paper, we argue in favor of extending this process to the set 16=℘(4) (and beyond). It turns out that this generalization is well-motivated and leads from the bilattice FOUR2 with an information and a truth-and-falsity ordering to another algebraic structure, namely the trilattice SIXTEEN3 with an information ordering together with a truth ordering and a (distinct) falsity ordering. Interestingly, the logics generated separately by the algebraic operations under the truth order and under the falsity order in SIXTEEN3 coincide with the logic of FOUR2, namely first degree entailment. This observation may be taken as a further indication of the significance of first degree entailment. In the present setting, however, it becomes rather natural to consider also logical systems in the language obtained by combining the vocabulary of the logic of the truth order and the falsity order. We semantically define the logics of the two orderings in the extended language and in both cases axiomatize a certain fragment comprising three unary operations: a negation, an involution, and their combination. We also suggest two other definitions of logics in the full language, including a bi-consequence system. In other words, in addition to presenting first degree entailment as a useful 16-valued logic, we define further useful 16-valued logics for reasoning about truth and (non-)falsity. We expect these logics to be an interesting and useful instrument in information processing, especially when we deal with a net of hierarchically interconnected computers. We also briefly discuss Arieli’s and Avron’s notion of a logical bilattice and state a number of open problems for future research.

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

Similar content being viewed by others

References

  1. Allwein, G. and MacCaull, W.: A Kripke semantics for the logic of Gelfand Quantales, Sudia Logica 68 (2001), 173–228.

    Article  Google Scholar 

  2. Anderson, A. R. and Belnap, N. D.: Entailment: The Logic of Relevance and Necessity, Vol. I, Princeton University Press, Princeton, NJ, 1975.

    Google Scholar 

  3. Anderson, A. R., Belnap, N. D. and Dunn, J. M.: Entailment: The Logic of Relevance and Necessity, Vol. II, Princeton University Press, Princeton, NJ, 1992.

    Google Scholar 

  4. Arieli, O. and Avron, A.: Logical bilattices and inconsistent data, in Proceedings 9th IEEE Annual Symposium on Logic in Computer Science, IEEE Press, 1994,pp. 468–476.

  5. Arieli, O. and Avron, A.: Reasoning with logical bilattices, Journal of Logic, Language and Information 5 (1996), 25–63.

    Google Scholar 

  6. Arieli, O. and Avron, A.: Bilattices and paraconsistency, in D. Batens et al. (eds.), Frontiers of Paraconsistent Logic, Research Studies Press, Baldock, Hertfordshire, 2000, pp. 11–27.

    Google Scholar 

  7. Avron, A.: The structure of interlaced bilattices, Mathematical Structures in Computer Science 6 (1996), 287–299.

    Google Scholar 

  8. Avron, A.: On the expressive power of three-valued and four-valued languages, Journal of Logic and Computation 9 (1999), 977–994.

    Article  Google Scholar 

  9. Belnap, N. D.: A useful four-valued logic, in J. M. Dunn and G. Epstein (eds.), Modern Uses of Multiple-Valued Logic, D. Reidel Publishing Company, Dordrecht, 1977, pp. 8–37.

    Google Scholar 

  10. Belnap, N. D.: How a computer should think, in G. Ryle (ed.), Contemporary Aspects of Philosophy, Oriel Press Ltd., Stocksfield, 1977, pp. 30–55.

    Google Scholar 

  11. Białynicki-Birula, A. and Rasiowa, H.: On the representation of quasi-boolean algebras, Bulletin de l’Acad’emie Polonaise des Sciences 5 (1957), 259–261.

    Google Scholar 

  12. Biedermann, K.: An equational theory for trilattices, Algebra Universalis 42 (1999), 253–268.

    Article  Google Scholar 

  13. Bochman, A.: Biconsequence relations: A four-valued formalism of reasoning with inconsistency and incompleteness, Notre Dame Journal of Formal Logic 39 (1998), 47–73.

    Article  Google Scholar 

  14. Dunn, J. M.: The algebra of intensional logics, Doctoral Dissertation, University of Pittsburgh, Ann Arbor, 1966 (University Microfilms).

  15. Dunn, J. M.: An intuitive semantics for first degree relevant implications (abstract), Journal of Symbolic Logic 36 (1971), 362–363.

    Google Scholar 

  16. Dunn, J. M.: Intuitive semantics for first-degree entailment and ‘coupled trees’, Philosophical Studies 29 (1976), 149–168.

    Article  Google Scholar 

  17. Dunn, J. M.: Relevance logic and entailment, in D. Gabbay and F. Guenter (eds.), Handbook of Philosophical Logic, Vol. III, D. Reidel Publishing Company, Dordrecht, 1986, pp. 117–224.

    Google Scholar 

  18. Dunn, J. M.: A Comparative study of various model-theoretic treatments of negation: A history of formal negation, in D. M. Gabbay and H. Wansing (eds.), What is Negation?, Applied Logic Series 13, Kluwer Academic Publishers, Dordrecht, 1999, pp. 23–51.

    Google Scholar 

  19. Dunn, J. M.: Partiality and its dual, Studia Logica 66 (2000), 5–40.

    Article  Google Scholar 

  20. Dunn, J. M. and Hardegree, G. M.: Algebraic Methods in Philosophical Logic, Oxford University Press, Oxford, 2001.

    Google Scholar 

  21. Fitting, M.: Bilattices and the theory of truth, Journal of Philosophical Logic 18 (1989), 225–256.

    Article  Google Scholar 

  22. Fitting, M.: Kleene’s logic, generalized, Journal of Logic and Computation 1 (1990), 797–810.

    Google Scholar 

  23. Fitting, M.: Bilattices in logic programming, in G. Epstein (ed.), The Twentieth International Symposium on Multiple-Valued Logic, IEEE Press, 1990, pp. 238–246.

  24. Fitting, M.: Bilattices and the semantics of logic programming, Journal of Logic Programming 11 (1991), 91–116.

    Article  Google Scholar 

  25. Fitting, M.: Kleene’s three-valued logic and their children, Fundamenta Informaticae 20 (1994), 113–131.

    Google Scholar 

  26. Fitting, M.: A theory of truth that prefers falsehood, Journal of Philosophical Logic 26 (1997), 447–500.

    Article  Google Scholar 

  27. Fitting, M.: Bilattices are nice things, in V. F. Hendricks, S. A. Pedersen and T. Bolander (eds.), Self-Reference, CSLI Publications, Cambridge University Press, 2004.

  28. Font, J. M.: Belnap’s four-valued logic and De Morgan lattices, Logic Journal of the IGPL 5 (1997), 413–440.

    Google Scholar 

  29. Ganter, B. and Wille, R.: Formal Concept Analysis: Mathematical Foundations, Springer-Verlag, Berlin, 1999.

    Google Scholar 

  30. Gargov, G.: Knowledge, uncertainty and ignorance in logic: Bilattices and beyond, Journal of Applied Non-Classical Logics 9 (1999), 195–203.

    Google Scholar 

  31. Ginsberg, M.: Multi-valued logics, in Proceedings of AAAI-86, Fifth National Conference on Artificial Intellegence, Morgan Kaufman Publishers, Los Altos, 1986, pp. 243–247.

    Google Scholar 

  32. Ginsberg, M.: Multivalued logics: A uniform approach to reasoning in AI, Computer Intelligence 4 (1988), 256–316.

    Google Scholar 

  33. Jain, P.: Investigating Hypercontradictions, May 1997 (Unpublished Mns).

  34. Kamide, N.: Quantized linear logic, involutive quantales and strong negation, to appear in Studia Logica.

  35. Karpenko, A.: Truth values: What are they? (in Russian), in V. Smirnov (ed.), Investigations in Non-classical Logics, Nauka, Moscow, 1989, pp. 38–53.

    Google Scholar 

  36. Lakshmanan, L. V. S. and Sadri, F.: Probabalistic deductive databases, in M. Bruynooghe (ed.), Proceedings of 1994 International Logic Programming Symposium, MIT Press, 1994, pp. 254–268.

  37. Meyer, R. K.: Why I am not a relevantist, Research paper No. 1, Australian National University, Logic Group, Research School of the Social Sciences, Canberra, 1978.

  38. Priest, G.: Hyper-contradictions, Logique et Analyse 27 (1984), 237–243.

    Google Scholar 

  39. Schöter, A.: Evidential bilattice logic and lexical inference, Journal of Logic, Language and Information 5 (1996), 65–105.

    Google Scholar 

  40. Shramko, Y., Dunn, J. M. and Takenaka, T.: The trilattice of constructive truth values, Journal of Logic and Computation 11 (2001), 761–788.

    Article  Google Scholar 

  41. Voishvillo, E. K.: A theory of logical relevance, Logique et Analyse 155–156 (1996), 207–228.

    Google Scholar 

  42. Voutsadakis, G.: Poliadic concept analysis, Order 19 (2002), 295–304.

    Article  Google Scholar 

  43. Wansing, H.: Short dialogue between M (Mathematician) and P (Philosopher) on multi-lattices, Journal of Logic and Computation 11 (2001), 759–760.

    Article  Google Scholar 

  44. Wille, R.: The basic theorem of triadic concept analysis, Order 12 (1995), 149–158.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yaroslav Shramko.

Additional information

Dedicated to Nuel D. Belnap on the occasion of his 75th Birthday

Rights and permissions

Reprints and permissions

About this article

Cite this article

Shramko, Y., Wansing, H. Some Useful 16-Valued Logics: How a Computer Network Should Think. J Philos Logic 34, 121–153 (2005). https://doi.org/10.1007/s10992-005-0556-5

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10992-005-0556-5

Keywords

Navigation