Advertisement

Soft Computing

, Volume 7, Issue 3, pp 179–183 | Cite as

Basic fuzzy logic and BL-algebras II

  • P. Hájek
Original paper

Abstract

 Three new (easy) results about the computational complexity of basic propositional fuzzy logic BL are presented. An important formula of predicate logic is shown 1-true in all interpretations over saturated BL-chains but is not a BL-1-tautology, i.e. is not 1-true in a safe interpretation over a non-saturated BL-algebra.

Keywords

Computational Complexity Fuzzy Logic Predicate Logic Basic Fuzzy Logic Important Formula 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • P. Hájek
    • 1
  1. 1.Institute of computer science AS CR, 182 07 Prague, Czech Republic E-mail: hajek@cs.cas.czCZ

Personalised recommendations