Graded consequence relations and fuzzy closure operator (Q3130049)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1002322
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Graded consequence relations and fuzzy closure operator |
scientific article; zbMATH DE number 1002322 |
Statements
Graded consequence relations and fuzzy closure operator (English)
0 references
22 April 1997
0 references
fuzzy closure operator
0 references
graded consequence relation
0 references
0.90352523
0 references
0.8929825
0 references
0.8804143
0 references
0.8764752
0 references
0.8710934
0 references
The role of a closure operator in the framework of formal (binary) logics has been recognized very early by Tarski: similarly, many papers have proved the usefulness of a fuzzy closure operator in Zadeh's logic of approximate reasoning. It is well known that there exists a bijection between the class of consequence relations and the class of closure operators on a set of formulas. In 1988, \textit{M. K. Chakraborty} [Fuzzy logic in knowledge-based systems, decision and control, 247-257 (1988; Zbl 0666.03022)] extended the concept of a consequence relation to the theory of fuzzy sets by introducing a graded consequence relation. This paper concentrates on the connections between fuzzy closure operators and graded consequence relations. A slightly modified version of the above-mentioned bijection could be established: there exists a bijection between the class of graded consequence relations and a subclass of the class of fuzzy closure operators namely those that can be represented as a chain of (crisp) closure operators.
0 references