Which Fuzzy Logic Satisfy the Compactness Problem?
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985807%3A_____%2F02%3A06020050" target="_blank" >RIV/67985807:_____/02:06020050 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Which Fuzzy Logic Satisfy the Compactness Problem?
Original language description
Compactness in an important property of a classical logic. It states that simultaneous satisfiability of an infinite set of formulas is equivalent to the satisfiablity of all its subsets. In fuzzy logics, we have different degrees of satisfiability, hence the questions of compactness become more complicated. Here we give an overview of recent results on compactness of various fuzzy logics.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>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
Article name in the collection
Information Processing and Management Uncertainty in Knowledge-based Systems.
ISBN
2-9516453-1-7
ISSN
—
e-ISSN
—
Number of pages
5
Pages from-to
405-409
Publisher name
ESIA
Place of publication
Savoie
Event location
Annency [FR]
Event date
Jul 1, 2002
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—