Skip to main content

Abstract

Boolean algebra (BA) was introduced by George Boole in his first book The Mathematical Analysis of Logic (1847) and set forth more fully in his An Investigation of the Laws of Thought (1854). According to Huntington, the term “Boolean algebra” was first suggested by Sheffer in 1913. Fuzzy logic is a form of many-valued logic in which the truth values of variables may be any real number between 0 and 1, considered to be “fuzzy.” By contrast, in Boolean logic, the truth values of variables may only be the “crisp” values 0 or 1. Fuzzy logic has been employed to handle the concept of partial truth, where the truth value may range between completely true and completely false. Furthermore, when linguistic variables are used, these degrees may be managed by specific (membership) functions. The term fuzzy logic was introduced with the 1965 proposal of fuzzy set theory by Lotfi Zadeh. Fuzzy logic had however been studied since the 1920s, as infinite-valued logic—notably by Lukasiewicz and Tarski. In this chapter we look at both of these logics holistically; any extensive details are beyond the scope of this book, and we encourage our readers to refer to so many books and articles that can be found on the Internet or Amazon.

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
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
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.

    Observe that truth function F c :L. L generalizes truth table of two-valued Boolean logic, as the latter can be regarded as functions F c :{0,1}n → {0,1}.

References

  1. Donald Monk, J. Retrieved from https://plato.stanford.edu/entries/boolalg-math/.

    Google Scholar 

  2. Lukasiewicz, J., & Tarski, A. (1930). Untersuchungen über den Aussagenkalkül. Comptes Rendus des Séances de la Société des Sciences et des Lettres de Varsovie, 23, 30–50.

    Google Scholar 

  3. Dummett, M. (1959). A propositional calculus with denumerable matrix. Journal of Symbolic Logic, 24, 97–106.

    Article  MathSciNet  MATH  Google Scholar 

  4. Hájek, P. (1998). Meta-mathematics of fuzzy logic, Trends in logic (Vol. 4). Dordrecht: Kluwer.

    Book  Google Scholar 

  5. Cintula, P., Hájek, P., & Noguera, C. (Eds.). (2011). Handbook of mathematical fuzzy logic, Studies in logic, mathematical logic and foundations (Vol. 37 and 38). London: College Publications.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this chapter

Cite this chapter

Zohuri, B., Moghaddam, M. (2017). Mathematics and Logic Behind Boolean and Fuzzy Computation. In: Business Resilience System (BRS): Driven Through Boolean, Fuzzy Logics and Cloud Computation. Springer, Cham. https://doi.org/10.1007/978-3-319-53417-6_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-53417-6_8

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-53416-9

  • Online ISBN: 978-3-319-53417-6

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics