Representation of logic formulas by normal forms
Kybernetika, Tome 38 (2002) no. 6, p. [717]
Voir la notice de l'article provenant de la source Czech Digital Mathematics Library
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.
@article{KYB_2002__38_6_a3,
author = {Da\v{n}kov\'a, Martina},
title = {Representation of logic formulas by normal forms},
journal = {Kybernetika},
pages = {[717]},
publisher = {mathdoc},
volume = {38},
number = {6},
year = {2002},
mrnumber = {1954393},
zbl = {1265.03013},
language = {en},
url = {http://geodesic.mathdoc.fr/item/KYB_2002__38_6_a3/}
}
Daňková, Martina. Representation of logic formulas by normal forms. Kybernetika, Tome 38 (2002) no. 6, p. [717]. http://geodesic.mathdoc.fr/item/KYB_2002__38_6_a3/