Associativeness versus recursiveness
Absikact-Fuzzy connectives use to be assumed associative. In this way, key operational difficulties are solved by means of a single binary operator. In this paper we point out that the main property in order to assure operativeness should be recurszveness, which is weaker than associativity. If calc...
| Autores: | , , |
|---|---|
| Tipo de recurso: | capítulo de libro |
| Fecha de publicación: | 1996 |
| País: | España |
| Institución: | Universidad Complutense de Madrid (UCM) |
| Repositorio: | Docta Complutense |
| Idioma: | inglés |
| OAI Identifier: | oai:docta.ucm.es:20.500.14352/60888 |
| Acceso en línea: | https://hdl.handle.net/20.500.14352/60888 |
| Access Level: | acceso abierto |
| Palabra clave: | 510.64 Formal logic Fuzzy set theory Recursive functions Lógica simbólica y matemática (Matemáticas) 1102.14 Lógica Simbólica |
| Sumario: | Absikact-Fuzzy connectives use to be assumed associative. In this way, key operational difficulties are solved by means of a single binary operator. In this paper we point out that the main property in order to assure operativeness should be recurszveness, which is weaker than associativity. If calculus can be obtained by means of a recursive application of a sequence of binary connectives, we still can develop operative models. It is then clearly seen that a fuzzy rule should be always understood as a family of fuzzy connectives. |
|---|