Skip to main content

A Relational Formalisation of a Generic Many—Valued Modal Logic

  • Chapter
Relational Methods for Computer Science Applications

Part of the book series: Studies in Fuzziness and Soft Computing ((STUDFUZZ,volume 65))

Abstract

In the paper we define a generic many valued modal logic, in which modalities are defined in the most general way possible following the idea of Thomason. Both the valuation of formulae and the accessibility predicates — replacing the usual accessibility relations — can be many valued. We present two types of semantics of the logic: the standard (Kripke) one and a relational one. In connection with the latter, we define a special calculus of relations corresponding to the connectives and modalities of the logic, and we develop a complete deduction system in Rasiowa-Sikowski style for this calculus. We illustrate the results by applying our formalisation to the two-valued modalities of possibility and necessity, and to a general class of many-valued modal logics defined by Fitting.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Carnielli W. (1987) Systematization of finite many-valued logics through the method of tableaux. Journal of Symbolic Logic 52(2):473–493

    Article  MathSciNet  MATH  Google Scholar 

  2. Carnielli W. (1991) On sequents and tableaux for many-valued logics. Journal of Non-Classical Logic 8(1):59–76

    MathSciNet  MATH  Google Scholar 

  3. Fitting M.C. (1992) Many-valued modal logics. Fundamenta Informaticae, 15:235–254

    MathSciNet  Google Scholar 

  4. Fitting M.C. (1992a) Many-valued modal logics II. Fundamenta Informaticae, 17:55–73

    MathSciNet  MATH  Google Scholar 

  5. Frias M., Orlowska E. (1995) A proof system for fork algebras and its applications to reasoning in logics based on intuitionism. Logique et Analyse, 150–151–152:239–284

    MathSciNet  Google Scholar 

  6. Frias M., Orlowska E. (1998) Equational reasoning in nonclassical logics. Journal of Applied Non-Classical Logics, 8(1–2):27–66

    Article  MathSciNet  MATH  Google Scholar 

  7. Konikowska B., Morgan C., Orlowska E. (1998) A relational formalisation of arbitrary many-valued logics. Journal of IGPL, 6(5):755–774

    Article  MathSciNet  MATH  Google Scholar 

  8. MacCaull W. (1997) Relational proof system for linear and other substructural logics. Logic Journal of the IGPL, 5(5) 673–697

    Article  MathSciNet  MATH  Google Scholar 

  9. MacCaull W. (1998) Relational semantics and a relational proof theory for full Lambek calculus. Journal of Symbolic Logic, 63:623–637

    Article  MathSciNet  MATH  Google Scholar 

  10. Morgan Ch., Orlowska E. (1993) Kripke and relational-style semantics and associated tableau proof systems for arbitrary finite valued logics. Proceedings of the Workshop on Theorem Proving with Analytic Tableau and Related Methods, Marseille, France, 179–182

    Google Scholar 

  11. Orlowska E. (1988) Relational interpretation of modal logics. In: Andreka H., Monk D. and Nemeti I. (Eds.) Algebraic Logic. North Holland, Amsterdam, 443–471

    Google Scholar 

  12. Orlowska E. (1992) Relational proof system for relevant logics. Journal of Symbolic Logic 57:1425–1440

    Article  MathSciNet  MATH  Google Scholar 

  13. Orlowskka, E. (1994) Relational semantics for nonclassical logics: Formulas are relations. In: Wolenski J. (Ed.) Philosophical Logic in Poland. Kluwer, Dordrecht, 167–186

    Chapter  Google Scholar 

  14. Orlowska, E. (1995) Temporal logics in a relational framework, In: Bolc L. and Szalas A. (Eds.) Time and Logic — a Computational Approach. University College London Press, 249–277

    Google Scholar 

  15. Orlowska, E. (1996) Relational proof systems for modal logics. In: Wansing H. (Ed.) Proof Theory of Modal Logics. Kluwer, Dordrecht, 55–77

    Chapter  Google Scholar 

  16. Rasiowa H., Sikorski R. (1963) The Mathematics of Metamathematics, PWN, Warsaw

    MATH  Google Scholar 

  17. Thomason S.K. (1978) Possible worlds and many truth values. Studia Logica, 37:195–204

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Konikowska, B., Orłowska, E. (2001). A Relational Formalisation of a Generic Many—Valued Modal Logic. In: Orłowska, E., Szałas, A. (eds) Relational Methods for Computer Science Applications. Studies in Fuzziness and Soft Computing, vol 65. Physica, Heidelberg. https://doi.org/10.1007/978-3-7908-1828-4_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-7908-1828-4_11

  • Publisher Name: Physica, Heidelberg

  • Print ISBN: 978-3-662-00362-6

  • Online ISBN: 978-3-7908-1828-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics