Importation Algebras

3Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In recent years, many works have appeared that propose order from basic fuzzy logic connectives. However, all of them assume the connectives to possess some kind of monotonicity, which succinctly implies that the underlying set is already endowed with an order. In this work, given a set P≠∅, we define an algebra based on an implicative-type function I without assuming any order-theoretic properties, either on P or I. Terming it the importation algebra, since the law of importation becomes one of the main axioms in this algebra, we show that such algebras can impose an order on the underlying set P. We show that in the case P = [0,1] we can obtain new order-theoretic structures on it even when I is not a fuzzy implication and that one can recover the usual order on [0, 1] even from fuzzy implications that do not have the classical ordering property. Finally, we show a similar approach can lead us to obtaining order from conjunctive type connectives too.

Cite

CITATION STYLE

APA

Gupta, V. K., & Jayaram, B. (2019). Importation Algebras. In Advances in Intelligent Systems and Computing (Vol. 981, pp. 83–94). Springer Verlag. https://doi.org/10.1007/978-3-030-19494-9_8

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free