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...

Descripción completa

Detalles Bibliográficos
Autores: Cutello, Vincenzo, Montero De Juan, Francisco Javier, Molina Ferragut, Elisenda
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
id ES_be0524ffc394bb1f400daaefca53d43e
oai_identifier_str oai:docta.ucm.es:20.500.14352/60888
network_acronym_str ES
network_name_str España
repository_id_str
spelling Associativeness versus recursivenessCutello, VincenzoMontero De Juan, Francisco JavierMolina Ferragut, Elisenda510.64Formal logicFuzzy set theoryRecursive functionsLógica simbólica y matemática (Matemáticas)1102.14 Lógica SimbólicaAbsikact-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.IEEEUniversidad Complutense de Madrid19961996-01-0119961996-01-01book parthttp://purl.org/coar/resource_type/c_3248info:eu-repo/semantics/bookPartapplication/pdfhttps://hdl.handle.net/20.500.14352/60888reponame:Docta Complutenseinstname:Universidad Complutense de Madrid (UCM)Inglésengopen accesshttp://purl.org/coar/access_right/c_abf2info:eu-repo/semantics/openAccessoai:docta.ucm.es:20.500.14352/608882026-06-02T12:44:21Z
dc.title.none.fl_str_mv Associativeness versus recursiveness
title Associativeness versus recursiveness
spellingShingle Associativeness versus recursiveness
Cutello, Vincenzo
510.64
Formal logic
Fuzzy set theory
Recursive functions
Lógica simbólica y matemática (Matemáticas)
1102.14 Lógica Simbólica
title_short Associativeness versus recursiveness
title_full Associativeness versus recursiveness
title_fullStr Associativeness versus recursiveness
title_full_unstemmed Associativeness versus recursiveness
title_sort Associativeness versus recursiveness
dc.creator.none.fl_str_mv Cutello, Vincenzo
Montero De Juan, Francisco Javier
Molina Ferragut, Elisenda
author Cutello, Vincenzo
author_facet Cutello, Vincenzo
Montero De Juan, Francisco Javier
Molina Ferragut, Elisenda
author_role author
author2 Montero De Juan, Francisco Javier
Molina Ferragut, Elisenda
author2_role author
author
dc.contributor.none.fl_str_mv Universidad Complutense de Madrid
dc.subject.none.fl_str_mv 510.64
Formal logic
Fuzzy set theory
Recursive functions
Lógica simbólica y matemática (Matemáticas)
1102.14 Lógica Simbólica
topic 510.64
Formal logic
Fuzzy set theory
Recursive functions
Lógica simbólica y matemática (Matemáticas)
1102.14 Lógica Simbólica
description 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.
publishDate 1996
dc.date.none.fl_str_mv 1996
1996-01-01
1996
1996-01-01
dc.type.none.fl_str_mv book part
http://purl.org/coar/resource_type/c_3248
dc.type.openaire.fl_str_mv info:eu-repo/semantics/bookPart
format bookPart
dc.identifier.none.fl_str_mv https://hdl.handle.net/20.500.14352/60888
url https://hdl.handle.net/20.500.14352/60888
dc.language.none.fl_str_mv Inglés
eng
language_invalid_str_mv Inglés
language eng
dc.rights.none.fl_str_mv open access
http://purl.org/coar/access_right/c_abf2
dc.rights.openaire.fl_str_mv info:eu-repo/semantics/openAccess
rights_invalid_str_mv open access
http://purl.org/coar/access_right/c_abf2
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.publisher.none.fl_str_mv IEEE
publisher.none.fl_str_mv IEEE
dc.source.none.fl_str_mv reponame:Docta Complutense
instname:Universidad Complutense de Madrid (UCM)
instname_str Universidad Complutense de Madrid (UCM)
reponame_str Docta Complutense
collection Docta Complutense
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869418250685644800
score 15,301603

Similares en LA Referencia