The principle approach to the construction of approximating formulas is discussed. We suggest the generalized definition of normal forms in predicate BL-logic and prove the conditional equivalence between a formula and each of its normal form.
The principle approach to the construction of approximating formulas is discussed. We suggest the generalized definition of normal forms in predicate BL-logic and prove the conditional equivalence between a formula and each of its normal form. (en)