Skip to main content

On Possibilistic Modal Logics Defined Over MTL-Chains

  • Chapter
  • First Online:
Petr Hájek on Mathematical Fuzzy Logic

Part of the book series: Outstanding Contributions to Logic ((OCTR,volume 6))

Abstract

In this chapter we revisit a 1994 chapter by Hájek et al. where a modal logic over a finitely-valued Łukasiewicz logic is defined to capture possibilistic reasoning. In this chapter we go further in two aspects: first, we generalize the approach in the sense of considering modal logics over an arbitrary finite MTL-chain, and second, we consider a different possibilistic semantics for the necessity and possibility modal operators. The main result is a completeness proof that exploits similar techniques to the ones involved in Hájek et al.’s previous work.

Dedicated to Petr Hájek

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 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover 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.

    Actually, Hájek et al. (1994) was for F. Esteva and L. Godo the first joint paper with P. Hájek.

  2. 2.

    In the sense of Possibility Theory (Dubois and Prade 1988).

  3. 3.

    In fact, as it is explained in Sect. 11.2, two-valued possibility and necessity measures over classical propositions can be taken as an alternative semantics for the modal operators in the system KD45.

  4. 4.

    Other connectives are defined as usual in MTL, for instance \(\lnot \varphi \) is \(\varphi \rightarrow \overline{0}\), \(\varphi \vee \psi \) is \(((\varphi \rightarrow \psi ) \rightarrow \psi ) \wedge ((\psi \rightarrow \varphi ) \rightarrow \varphi )\), and \(\varphi \leftrightarrow \psi \) is \((\varphi \rightarrow \psi ) \wedge (\psi \rightarrow \varphi )\).

  5. 5.

    We use the notation \(e(w, \cdot )\) to denote the function \(p \in Var \longmapsto e(w,p) \in A\).

  6. 6.

    Here we use the fact the equation \(x \Rightarrow (y \Rightarrow z) = (x \odot y) \Rightarrow z\) holds in every MTL-chain.

  7. 7.

    Here we use the fact the equation \((x_1 \Rightarrow y) \wedge (x_2 \Rightarrow y) = (x_1 \vee x_2) \Rightarrow y\) holds in every MTL-chain.

  8. 8.

    Notice that these axioms could also be expressed as the following B-formulas:

    $$ \begin{aligned} (r \odot s)(\overline{r} \& \overline{s}), \; (r \Rightarrow s)(\overline{r} \rightarrow \overline{s}), \; (\min (r,s))(\overline{r} \wedge \overline{s}), \; (\triangle r) \triangle \overline{r} \; \text {and} \; \bigvee \nolimits _{r \in A} (r) \varphi . \end{aligned}$$

    However, the adopted formulation makes less use of the \(\triangle \) connective.

  9. 9.

    Recall that a complete theory is prime in the classical sense for B-formulas.

  10. 10.

    This definition is sound due to (c) of Lemma 11.3.

References

  • Banerjee, M., & Dubois, D. (2009). A simple modal logic for reasoning about revealed beliefs. In C. Sossai, G. Chemello (Eds.), ECSQARU 2009, Lecture Notes in Computer Science (Vol. 5590, pp. 805–816). Berlin: Springer.

    Google Scholar 

  • Bou, F., Esteva, F., Godo, L., & Rodríguez, R. (2011). On the minimum many-valued modal logic over a finite residuated lattice. Journal of Logic and Computation, 21(5), 739–790.

    Article  MathSciNet  MATH  Google Scholar 

  • Dellunde, P., Godo, L., & Marchioni, E. (2011). Extending possibilistic logic over Gödel logic. International Journal of Approximate Reasoning, 52(1), 63–75.

    Google Scholar 

  • Dubois, D., Prade, H., & Schockaert, S. (2012). Stable models in generalized possibilistic logic. Proceedings of KR, 2012, 519–529.

    Google Scholar 

  • Dubois, D., Lang, J., & Prade, H. (1994). Possibilistic logic. In Gabbay et al. (Eds.), Handbook of logic in artificial intelligence and logic programming, non monotonic reasoning and uncertain reasoning (Vol. 3, pp. 439–513). Oxford: Oxford University Press.

    Google Scholar 

  • Dubois, D., & Prade, H. (1988). Possibility theory. New York: Plenum Press.

    Google Scholar 

  • Dubois, D., & Prade, H. (2004). Possibilistic logic: A retrospective and prospective view. Fuzzy Sets and Systems, 144, 3–23.

    Google Scholar 

  • Fariñas del Cerro, L., & Herzig, A. (1991). A modal analysis of possibility theory. In Ph. Jorrand, & J. Kelemen (Eds.), Fundamentals of artificial intelligence research (FAIR 91), LNCS 535 (pp. 11–18) New York: Springer

    Google Scholar 

  • Flaminio, T., Godo, L., & Marchioni, E. (2011). On the logical formalization of possibilistic counterparts of states over \(n\)-valued Łukasiewicz events. Journal of Logic and Computation, 21(3), 429–446.

    Article  MathSciNet  MATH  Google Scholar 

  • Flaminio, T., Godo, L., & Marchioni, E. (2011). Reasoning about uncertainty of fuzzy events: An overview. In P. Cintula et al. (Eds.), Understanding Vagueness—logical, philosophical, and linguistic perspectives. Studies in logic (Vol. 36, pp. 367–401). London: College Publications.

    Google Scholar 

  • Hájek, P. (1998). Metamathematics of fuzzy logic. Trends in logic (Vol. 4). Kluwer: New York.

    Google Scholar 

  • Hájek, P. (2010). On fuzzy modal logics \(S5({\cal {C}})\). Fuzzy Sets and Systems, 161(18), 2389–2396.

    Google Scholar 

  • Hájek, P., Godo, L., & Esteva, F. (1995). Fuzzy logic and probability. In Proceedings of the eleventh annual conference on uncertainty in artificial intelligence conference (UAI’95) (pp. 237–244). San Francisco: Morgan Kaufmann.

    Google Scholar 

  • Hájek, P., Harmancová, D., Esteva, F., Garcia, P., & Godo, L. (1994). On modal logics for qualitative possibility in a fuzzy setting. In Proceedings of the tenth annual conference on uncertainty in artificial intelligence (UAI’94) (pp. 278–285). San Francisco: Morgan Kaufmann.

    Google Scholar 

  • Pietruszczak, A. (2009). Simplified Kripke style semantics for modal logics K45, KB4 and KD45. Bulletin of the Section of Logic, 38(3/4), 163–171.

    Google Scholar 

  • Radzikowska, A. M., & Kerre, E. E. (2005). Characterisation of main classes of fuzzy relations using fuzzy modal operators. Fuzzy Sets and Systems, 152(2), 223–247.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgments

The authors are deeply indebted to an anonymous reviewer for the useful comments that have helped to significantly improve the layout of this chapter. The authors also acknowledge partial support of the Spanish projects EdeTRI (TIN2012-39348-C02-01) and Agreement Technologies (CONSOLIDER CSD2007-0022, INGENIO 2010), and the grant 2009SGR-1433 from the Catalan Government. Initially they were also supported by the projects TASSAT (TIN2010-20967-C04-01) and 2009SGR-1434.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Lluís Godo .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Bou, F., Esteva, F., Godo, L. (2015). On Possibilistic Modal Logics Defined Over MTL-Chains. In: Montagna, F. (eds) Petr Hájek on Mathematical Fuzzy Logic. Outstanding Contributions to Logic, vol 6. Springer, Cham. https://doi.org/10.1007/978-3-319-06233-4_11

Download citation

Publish with us

Policies and ethics