Skip to main content

A New Characterization for n–Fold Positive Implicative BL–Logics

  • Conference paper
Advances on Computational Intelligence (IPMU 2012)

Abstract

We study Haveshki’s and Eslami’s n–fold positive implicative basic logics and prove that they are fragments of Łukasiewicz logic. We introduce n–fold Boolean filters and prove that n–fold positive implicative filters and n–fold Boolean filters coincide in BL–algebras; this generalizes the fact that positive implicative filters and Boolean filters coincide in BL–algebras, moreover this result yields another characterization for the n–fold positive implicative basic logic. Lastly we prove that filters that are both n–fold implicative and n–fold fantastic are exactly n–fold Boolean filters.

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 PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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.

References

  1. Borumand, A., Motamed, S.: Normal filters in BL-algebras. World Appl. Sci. J. 7 (Special issue for Applied Math.), 70–76 (2009)

    Google Scholar 

  2. Burris, S., Sankappanavar, H.P.: A Course in Universal Algebra. Springer, New York (1981)

    Book  MATH  Google Scholar 

  3. Hájek, P.: Metamathematics of Fuzzy Logic. Trends in Logic, Studia Logica Library, vol. 4. Kluwer, Dordrecht (1998)

    Book  MATH  Google Scholar 

  4. Haveshki, M., Borumand Saeid, A., Eslami, E.: Some types of filters in BL–algebras. Soft Comput. 10, 657–664 (2006)

    Article  MATH  Google Scholar 

  5. Haveshki, M., Eslami, E.: n–fold filters in BL–algebras. Math. Log. Quart. 54, 176–186 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  6. Höhle, U.: Commutative, residuated ℓ-monoids. In: Höhle, U., Klement, E. (eds.) Non–Classical Logics and Their Applications to Fuzzy Subsets, pp. 53–106. Kluwer, Dordrecht (1995)

    Chapter  Google Scholar 

  7. Kondo, M., Dudek, W.A.: Filter theory of BL–algebras. Soft Comput. 12, 419–423 (2008)

    Article  MATH  Google Scholar 

  8. Motamed, S., Saeid, A.: n–Fold obstinate filters in BL–algebras. Neural Computing and Applications 20, 461–472 (2011)

    Article  Google Scholar 

  9. Turunen, E.: BL–algebras of Basic Fuzzy Logic. Mathware & Soft Computing 6, 49–61 (1999)

    MathSciNet  MATH  Google Scholar 

  10. Turunen, E.: Boolean deductive systems of BL–algebras. Arch. Math. Logic 40, 467–473 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  11. Turunen, E.: Hyper–Archimedean BL–algebras are MV–algebras. Math. Log. Quart. 53, 170–177 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  12. Víta, M., Cintula, P.: Filters in algebras of fuzzy logics. In: Proceedings of the 7th Conference of EUSFLAT 2011 and LFA 2011, Aix–les–Bains, France, pp. 169–174 (2011)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Turunen, E., Tchikapa, N., Lele, C. (2012). A New Characterization for n–Fold Positive Implicative BL–Logics. In: Greco, S., Bouchon-Meunier, B., Coletti, G., Fedrizzi, M., Matarazzo, B., Yager, R.R. (eds) Advances on Computational Intelligence. IPMU 2012. Communications in Computer and Information Science, vol 297. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31709-5_56

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-31709-5_56

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-31708-8

  • Online ISBN: 978-3-642-31709-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics