Skip to main content
Springer Nature Link
Log in

n-Fold implicative basic logic is Gödel logic

  • Original Paper
  • Published:
Soft Computing Aims and scope Submit manuscript

    We’re sorry, something doesn't seem to be working properly.

    Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

An Erratum to this article was published on 06 December 2011

Abstract

We prove that Haveshki’s and Eslami’s n-fold implicative basic logic is Gödel logic and n-fold positive implicative basic logic is a fragment of ukasiewicz logic.

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

Access this article

Log in via an institution

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

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

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  • Burris S, Sankappanavar HP (1981) A course in universal algebra. Springer, New York

    Book  MATH  Google Scholar 

  • Hájek P (1998) Metamathematics of fuzzy logic. Trends in Logic, Studia Logica Library, vol 4. Kluwer, Dordrecht

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

    Article  MATH  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  • Höhle (1995) Commutative, residuated \(\ell\)-monoids. In: Höhle U, Klement E (eds) Non-classical logics and their applications to fuzzy subsets, pp 53–106. Kluwer, Dordrecht

  • Kondo MM, Dudek WA (2008) Filter theory of BL-algebras. Soft Comput 12:419–423

    Article  MATH  Google Scholar 

  • Turunen E (1999) BL-algebras of basic fuzzy logic. Mathware Soft Comput 6:49–61

    MATH  MathSciNet  Google Scholar 

  • Turunen E (2001) Boolean deductive systems of BL-algebras. Arch Math Log 40:467–473

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Tampere University Technology, Tampere, Finland

    Esko Turunen

  2. University of Dschang, Dschang, Cameroon

    Nganteu Tchikapa & Celestin Lele

Authors
  1. Esko Turunen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Nganteu Tchikapa
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Celestin Lele
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Esko Turunen.

Additional information

An erratum to this article can be found at http://dx.doi.org/10.1007/s00500-011-0795-z

Rights and permissions

Reprints and permissions

About this article

Cite this article

Turunen, E., Tchikapa, N. & Lele, C. n-Fold implicative basic logic is Gödel logic. Soft Comput 16, 177–181 (2012). https://doi.org/10.1007/s00500-011-0761-9

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00500-011-0761-9

Keywords