نتایج جستجو برای: topological residuated lattice

تعداد نتایج: 159255  

‎We give a simple and independent axiomatization of reticulations on residuated lattices‎, ‎which were axiomatized by five conditions in [C‎. ‎Mureşan‎, ‎The reticulation of a residuated lattice‎, ‎Bull‎. ‎Math‎. ‎Soc‎. ‎Sci‎. ‎Math‎. ‎Roumanie‎ ‎51 (2008)‎, ‎no‎. ‎1‎, ‎47--65]‎. ‎Moreover‎, ‎we show that reticulations can be considered as lattice homomorphisms between residuated lattices and b...

Journal: :Mathematics 2022

In this paper, we characterize residuated lattices for which the topological space of prime ideals is a Noetherian space. The notion i-Noetherian lattice introduced and related properties are investigated. We proved that iff every ideal principal. Moreover, show has spectrum it i-Noetherian.

Journal: :Hacettepe journal of mathematics and statistics 2022

Lattice-valued semiuniform convergence structures are important mathematical in the theory of lattice-valued topology. Choosing a complete residuated lattice $L$ as background, we introduce new type filters using tensor and implication operations on $L$, which is called $\top$-filters. By means $\top$-filters, propose concept $\top$-semiuniform counterpart structures. Different from usual discu...

A. Borumand Saeid L. C. Holdon

In this paper, we study residuated lattices in order to give new characterizations for dense, regular and Boolean elements in residuated lattices and investigate special residuated lattices in order to obtain new characterizations for the directly indecomposable subvariety of Stonean residuated lattices. Free algebra in varieties of Stonean residuated lattices is constructed. We introduce in re...

Journal: :Int. J. Math. Mathematical Sciences 2012
Shokoofeh Ghorbani Lida Torkzadeh

Ward and Dilworth 1 introduced the concept of residuated lattices as generalization of ideal lattices of rings. The residuated lattice plays the role of semantics for a multiple-valued logic called residuated logic. Residuated logic is a generalization of intuitionistic logic. Therefore it is weaker than classical logic. Important examples of residuated lattices related to logic are Boolean alg...

2013
William Young

Proposition 3. If A=〈A,∧,∨, ·, \, /, 1, γ〉 is a residuated lattice with a nucleus γ, then the algebra Aγ=〈Aγ ,∧,∨γ , ·γ , \, /, γ(1)〉 is a residuated lattice, where Aγ=γ[A] and for all x, y ∈ Aγ , x ∨γ y=γ(x ∨ y) and x ·γ y=γ(x · y). For a variety V of residuated lattices with modal operators, consider V∗, the full subcategory of V consisting of those pairs 〈B, 〉 such that B generates B as a re...

2009
XUEJUN LIU ZHUDENG WANG

In this paper, based on Hájek, Vychodil, Rachunek and Šalounová’s works, we study the concept of v-filters of residuated lattices with weak vt-operators, axiomatize very true operators, discuss filters and v-filters of residuated lattices with weak vt-operator, give the formulas for calculating the v-filters generated by subsets, and show that lattice of v-filters of a commutative residuated la...

2003
Hiroki TAKAMURA

A b s t r a c t. In this paper, we prove the semisimplicity of free biresiduated lattices, more precisely, integral residuated lattices. In [4], authors show that variety of residuated lattices, more precisely, commutative integral residuated lattices, is generated by its finite simple members. The result is obtained by showing that every free residuated lattice is semisimple and then showing t...

Journal: :Fuzzy Sets and Systems 2023

This paper studies a fascinating type of filter in residuated lattices, the so-called pure filters. A combination algebraic and topological methods on filters lattice is applied to obtain some new structural results. The notion purely-prime has been investigated, Cohen-type theorem obtained. It shown that spectrum compact sober space, Grothendieck-type demonstrated. proved Gelfand Hausdorff ded...

2005
DAVID STANOVSKÝ

We investigate the variety of residuated lattices with a commutative and idempotent monoid reduct. A residuated lattice is an algebra A = (A,∨,∧, ·, e, /, \) such that (A,∨,∧) is a lattice, (A, ·, e) is a monoid and for every a, b, c ∈ A ab ≤ c ⇔ a ≤ c/b ⇔ b ≤ a\c. The last condition is equivalent to the fact that (A,∨,∧, ·, e) is a lattice-ordered monoid and for every a, b ∈ A there is a great...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید