Skip to main content

SIXTEEN\(_3\) in Light of Routley Stars

  • Conference paper
  • First Online:
Logic, Language, Information, and Computation (WoLLIC 2019)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 11541))

  • 625 Accesses

Abstract

For one of the most well-known many-valued logics FDE, there are several semantics, including the star semantics by Richard Routley and Valerie Routley, the two-valued relational semantics by Michael Dunn and the four-valued semantics by Nuel Belnap. The last semantics inspired Yaroslav Shramko and Heinrich Wansing to introduce the trilattice SIXTEEN\(_3\). In this article, we offer two alternative semantical presentations for SIXTEEN\(_3\), by applying the Routleys’ semantics and the Dunn semantics. Based on our new semantics, we discuss related systems with less truth values, as well as the relation to FDE-based modal logics.

The work reported in this paper started during DS’s visit to Japan which was supported by JSPS KAKENHI Grant Number JP18K12183 granted to HO. HO was supported by a Sofja Kovalevskaja Award of the Alexander von Humboldt-Foundation, funded by the German Ministry for Education and Research. The work of DS has been carried out as part of the research project “FDE-based modal logics”, supported by the Deutsche Forschungsgemeinschaft, DFG, grant WA 936/13-1. We would like to thank Sergei Odintsov, Yaroslav Shramko, Heinrich Wansing, Zach Weber and the referees for helpful discussions and/or comments on an earlier draft.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    For a recent overview, see for example [17].

  2. 2.

    The formal details will be given in the next section, so we are justified to be brief.

  3. 3.

    For a mechanical procedure to reduce the number of truth values in FDE and its expansions, see [16].

  4. 4.

    Given a Dunn interpretation, conflation, written as −, is characterized by the following truth and falsity conditions: \(-Ar1\) iff not Ar0, and \(-Ar0\) iff not Ar1.

  5. 5.

    We thank Sergei Odintsov for pointing this out.

  6. 6.

    For a different approach to FDE-based modal logic, where FDE is captured in terms of the Dunn semantics (recall Definition 3), see, for example [13, 15]. Comparing the two approaches will be future work.

References

  1. Arieli, O., Avron, A.: Reasoning with logical bilattices. J. Log. Lang. Inf. 5(1), 25–63 (1996)

    Article  MathSciNet  Google Scholar 

  2. Belnap, N.: How a computer should think. In: Ryle, G. (ed.) Contemporary Aspects of Philosophy, pp. 30–55. Oriel Press (1976)

    Google Scholar 

  3. Belnap, N.: A useful four-valued logic. In: Dunn, J., Epstein, G. (eds.) Modern Uses of Multiple-Valued Logic, pp. 8–37. D. Reidel Publishing Co. (1977)

    Google Scholar 

  4. van Benthem, J.: Beyond accessibility. In: de Rijke, M. (ed.) Diamonds and Defaults: Studies in Pure and Applied Intensional Logic. SYLI, vol. 229, pp. 1–18. Springer, Dordrecht (1993). https://doi.org/10.1007/978-94-015-8242-1_1

    Chapter  Google Scholar 

  5. De, M., Omori, H.: Classical negation and expansions of Belnap-Dunn logic. Stud. Log. 103(4), 825–851 (2015)

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  7. Fuhrmann, A.: Models for relevant modal logics. Stud. Log. 49(4), 501–514 (1990)

    Article  MathSciNet  Google Scholar 

  8. Ginsberg, M.: Multi-valued logics: a uniform approach to AI. Comput. Intell. 4, 243–247 (1988)

    Google Scholar 

  9. Mares, E.D., Meyer, R.K.: The semantics of R4. J. Philos. Log. 22(1), 95–110 (1993)

    Article  Google Scholar 

  10. Muskens, R., Wintein, S.: Analytic tableaux for all of SIXTEEN\(_3\). J. Philos. Log. 44(5), 473–487 (2015)

    Article  Google Scholar 

  11. Muskens, R., Wintein, S.: Interpolation in 16-valued trilattice logics. Stud. Log. 106(2), 345–370 (2018)

    Article  MathSciNet  Google Scholar 

  12. Odintsov, S.P.: On axiomatizing Shramko-Wansing’s logic. Stud. Log. 91(3), 407–428 (2009)

    Article  MathSciNet  Google Scholar 

  13. Odintsov, S.P., Wansing, H.: Modal logics with Belnapian truth values. J. Appl. Non-Class. Log. 20, 279–301 (2010)

    Article  MathSciNet  Google Scholar 

  14. Odintsov, S.P., Wansing, H.: The logic of generalized truth values and the logic of bilattices. Stud. Log. 103(1), 91–112 (2015)

    Article  MathSciNet  Google Scholar 

  15. Odintsov, S.P., Wansing, H.: Disentangling FDE-based paraconsistent modal logics. Stud. Log. 105(6), 1221–1254 (2017)

    Article  MathSciNet  Google Scholar 

  16. Omori, H., Sano, K.: Generalizing functional completeness in Belnap-Dunn logic. Stud. Log. 103(5), 883–917 (2015)

    Article  MathSciNet  Google Scholar 

  17. Omori, H., Wansing, H.: 40 years of FDE: an introductory overview. Stud. Log. 105(6), 1021–1049 (2017)

    Article  MathSciNet  Google Scholar 

  18. Priest, G.: An Introduction to Non-Classical Logic: From If to Is, 2nd edn. Cambridge University Press, Cambridge (2008)

    Book  Google Scholar 

  19. Restall, G.: Negation in relevant logics (how i stopped worrying and learned to love the routley star). In: Gabbay, D.M., Wansing, H. (eds.) What is Negation?, pp. 53–76. Kluwer Academic Publishers (1999)

    Google Scholar 

  20. Routley, R., Routley, V.: Semantics for first degree entailment. Noûs 6, 335–359 (1972)

    Article  MathSciNet  Google Scholar 

  21. Shramko, Y., Wansing, H.: Truth and Falsehood - An Inquiry into Generalized Logical Values, 1st edn. Springer, Dordrecht (2012). https://doi.org/10.1007/978-94-007-0907-2

    Book  MATH  Google Scholar 

  22. Shramko, Y., Wansing, H.: Some useful 16-valued logics: how a computer network should think. J. Philos. Log. 34(2), 121–153 (2005)

    Article  MathSciNet  Google Scholar 

  23. Shramko, Y., Wansing, H.: Hyper-contradictions, generalized truth values and logics of truth and falsehood. J. Log. Lang. Inf. 15(4), 403–424 (2006)

    Article  MathSciNet  Google Scholar 

  24. Suszko, R.: Remarks on Łukasiewicz’s three-valued logic. Bull. Sect. Log. 4, 87–90 (1975)

    MATH  Google Scholar 

  25. Wansing, H.: The power of Belnap: sequent systems for SIXTEEN\(_3\). J. Philos. Log. 39, 369–393 (2010)

    Article  MathSciNet  Google Scholar 

  26. Zaitsev, D.: A few more useful 8-valued logics for reasoning with tetralattice EIGHT\(_4\). Stud. Log. 92(2), 265–280 (2009)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding authors

Correspondence to Hitoshi Omori or Daniel Skurt .

Editor information

Editors and Affiliations

Appendices

A Details of the Proof of Theorem 3

We prove the contrapositive. Assume \(A\not \vdash B\). Then, by Lindenbaum’s lemma, there is a prime theory \(\varGamma \) such that \(A\in \varGamma \) and \(B\not \in \varGamma \). We then define a two-star interpretation \(\langle W, g, *_1, *_2, v \rangle \) as follows:

figure l

If we can show that the above condition holds for all formulas, then the result follows since at \(a\in W\), \(I(a, A)=1\) but \(I(a, B)\ne 1\), i.e. \(A\not \models _*\,B\). We prove this by induction on the complexity of A. We only prove the cases for \({{\sim }}\) and \({{\sim }}_f\), since the cases for \(\wedge \) and \(\vee \) are straightforward.

Case 1. If A is an element of \(\mathsf {Prop}\), the result holds by definition.

Case 2. If \(A={{\sim }}B\), then

figure m

Case 3. If \(A={{\sim }}_f B\), then

figure n

This completes the proof.   \(\square \)

B Details of the Proof of Proposition 4

We prove the contrapositive. Assume \(A\not \models _r\,B\). Then, there is a one-star interpretation \(\langle W, g, *, r \rangle \) such that \(Ar_g1\), but not \(Br_g1\). We then define a two-star interpretation \(\langle W, g *_1, *_2, v \rangle \) as follows:

figure o

If we can show that the above condition holds for all formulas, then the result follows since at \(a\in W\), \(v(a, A)=1\) but \(v(a, B)\ne 1\), i.e. \(A\not \models _{*,g}\,B\). We prove this by induction. We only prove the cases for \({{\sim }}\) and \({{\sim }}_f\), since the cases for \(\wedge \) and \(\vee \) are straightforward.

Case 1. If A is an element of \(\mathsf {Prop}\), the result holds by definition.

Case 2. If \(A={{\sim }}B\), then

figure p

Case 3. If \(A={{\sim }}_f B\), then

figure q

This completes the proof.   \(\square \)

C Details of the Proof for Proposition 5

We prove the contrapositive. Assume \(A\not \models _{*,g}\,B\). Then, there is a two-star interpretation \(\langle W, g, *_1, *_2, v \rangle \) such that \(I(g, A)=1\) but \(I(g, B)\ne 1\). We then define a one-star interpretation \(\langle W, g, *, r \rangle \) as follows:

figure r

If we can show that the above condition holds for all formulas, then the result follows since at \(a\in W\), \(Ar_a1\) but not \(Br_a1\), i.e. \(A\not \models _r\,B\). We prove this by induction. We only prove the cases for \({{\sim }}\) and \({{\sim }}_f\), since the cases for \(\wedge \) and \(\vee \) are straightforward.

Case 1. If A is an element of \(\mathsf {Prop}\), the result holds by definition.

Case 2. If \(A={{\sim }}B\), then

figure s

Case 3. If \(A={{\sim }}_f B\), then

figure t

This completes the proof.   \(\square \)

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer-Verlag GmbH Germany, part of Springer Nature

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Omori, H., Skurt, D. (2019). SIXTEEN\(_3\) in Light of Routley Stars. In: Iemhoff, R., Moortgat, M., de Queiroz, R. (eds) Logic, Language, Information, and Computation. WoLLIC 2019. Lecture Notes in Computer Science(), vol 11541. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-59533-6_31

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-59533-6_31

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-59532-9

  • Online ISBN: 978-3-662-59533-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics