نتایج جستجو برای: complete residuated lattices
تعداد نتایج: 381361 فیلتر نتایج به سال:
In this talk we are going to explore an interesting connection between the famous Burnside problem for groups, regular languages, and residuated lattices. Let K be a finitely axiomatized class of residuated lattices. Recall that the usual way of proving decidability of universal theory for K is to establish that K has the finite embeddability property (FEP) [2, 3]. It turns out that the method ...
In this paper, we investigate the properties of L-lower approximation operators as a generalization of fuzzy rough set in complete residuated lattices. We study relations lower (upper, join meet, meet join) approximation operators and Alexandrov L-topologies. Moreover, we give their examples as approximation operators induced by various L-fuzzy relations.
The paper deals with fuzzy attribute logic (FAL) and shows its completeness over all complete residuated lattices. FAL is a calculus for reasoning with if-then rules describing particular attribute dependencies in objectattribute data. Completeness is proved in two versions: classical-style completeness and graded-style completeness.
Abstract The Alexandrov L -fuzzy nearness is a new addition to the systems that base for intelligent and its wide applications in various fields. This paper represents connections among such as: rough sets, semi-topogenous orders uniformities complete residuated lattices. Moreover, we show there Galois correspondence between categories of those mentioned systems.
In this paper, we introduce the notions of L-fuzzy quasi-uniformities and Lfuzzy interior operators in complete residuated lattices. We investigate the L-fuzzy quasiuniformities induced by L-fuzzy interior operators. We study the relationships between Lfuzzy interior operators and L-fuzzy quasi-uniformities. We give their examples. AMS Subject Classification: 03E72, 06A15, 06F07, 54F05
This is an introductory survey of substructural logics and of residuated lattices which are algebraic structures for substructural logics. Our survey starts from sequent systems for basic substructural logics and develops the proof theory of them. Then, residuated lattices are introduced as algebraic structures for substructural logics, and some recent developments of their algebraic study are ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید