Representation of Logic Formulas by Normal Forms
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61988987%3A17610%2F02%3A00000017" target="_blank" >RIV/61988987:17610/02:00000017 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Representation of Logic Formulas by Normal Forms
Original language description
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.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
—
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2002
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Kybernetika
ISSN
0023-5954
e-ISSN
—
Volume of the periodical
Neuveden
Issue of the periodical within the volume
—
Country of publishing house
CZ - CZECH REPUBLIC
Number of pages
18
Pages from-to
711-728
UT code for WoS article
—
EID of the result in the Scopus database
—