Previous |  Up |  Next


BL-logic; extensionality
In this paper, we deal with the disjunctive and conjunctive normal forms in the frame of predicate BL-logic and prove theirs conditional equivalence to appropriate formulas. Our aim is to show approximation ability of special normal forms defined by means of reflexive binary predicate.
[1] Cignoli R., d’Ottaviano I. M. L., Mundici D.: Algebraic Foundations of Many–valued Reasoning. Kluwer, Dordrecht 2000 MR 1786097 | Zbl 0937.06009
[2] Hájek P.: Metamathematics of Fuzzy Logic. Kluwer, Dordrecht 1998 MR 1900263 | Zbl 1007.03022
[3] Kreinovich V., Nguyen H. T., Sprecher D. A.: Normal forms for fuzzy logic – an application of Kolmogorov’s theorem. Internat. J. Uncertainty, Fuzzy Knowledge-Based Systems 4 (1996), 331–349 DOI 10.1142/S0218488596000196 | MR 1414352 | Zbl 1232.03018
[4] Daňková M.: Extensionality and continuity of fuzzy relations. J. Electrical Engineering 51 (2000), (12/s), 33–35 Zbl 0972.03541
[5] Novák V., Perfilieva, I., Močkoř J.: Mathematical Principles of Fuzzy Logic. Kluwer, Boston – Dordrecht 1999 Zbl 0940.03028
[6] Perfilieva I.: Fuzzy logic normal forms for control law representation. In: Fuzzy Algorithms for Control (H. Verbruggen, H.-J. Zimmermann, and R. Babuska, eds.), Kluwer, Boston – Dordrecht 1999, pp. 111–125
[7] Perfilieva I.: Normal forms for fuzzy logic functions and their approximation ability. Fuzzy Sets and Systems, submitted Zbl 0994.03019
[8] Perfilieva I.: Logical approximation. Fuzzy Sets and Systems, submitted Zbl 1029.03503
Partner of
EuDML logo