Graded consequence relations and fuzzy closure operator

From MaRDI portal





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.











This page was built for publication: Graded consequence relations and fuzzy closure operator

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3130049)