2010
DOI: 10.1016/j.ins.2010.04.010
|View full text |Cite
|
Sign up to set email alerts
|

Filters of residuated lattices and triangle algebras

Abstract: An important concept in the theory of residuated lattices and other algebraic structures used for formal fuzzy logic, is that of a filter. Filters can be used, amongst others, to define congruence relations. Specific kinds of filters include Boolean filters and prime filters.In this paper, we define several different filters of residuated lattices and triangle algebras and examine their mutual dependencies and connections. Triangle algebras characterize interval-valued residuated lattices.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
41
0

Year Published

2010
2010
2017
2017

Publication Types

Select...
5
4

Relationship

0
9

Authors

Journals

citations
Cited by 63 publications
(41 citation statements)
references
References 24 publications
0
41
0
Order By: Relevance
“…A residuated lattice L in which x 2 = x for all x ∈ L (or, equivalently, in which x y = x ∧ y for all x, y ∈ L) is also called a Heyting algebra or pseudo-Boolean algebra [36,40]. We denote by H the class of Heyting algebras.…”
Section: Definition 1 (Seementioning
confidence: 99%
See 1 more Smart Citation
“…A residuated lattice L in which x 2 = x for all x ∈ L (or, equivalently, in which x y = x ∧ y for all x, y ∈ L) is also called a Heyting algebra or pseudo-Boolean algebra [36,40]. We denote by H the class of Heyting algebras.…”
Section: Definition 1 (Seementioning
confidence: 99%
“…In other works such as [5,10,27,37,40,49,50] a theory of filters is studied in the more general context of a residuated lattice, thus generalizing the results from BL-algebras.…”
Section: Introductionmentioning
confidence: 99%
“…These notions are mainly used to translate connections between properties on algebraic structures and to define congruence relations and quotient algebras [32,25]. They are played a central role in Stone representation theorem for Boolean lattice [28] and in the extensive theory of representation of distributive lattice [13,15,27].…”
Section: Introductionmentioning
confidence: 99%
“…For example, based on filters and prime filters in BL-algebras, Hájek proved the completeness of Basic Logic BL [18]. Literatures [1,4,5,8,12,17,24,30], further studied filters of BL-algebras, lattice implication algebras, pseudo BLalgebras, pseudo effect-algebras, residuated lattices, triangle algebras and the corresponding algebraic structures.…”
Section: Introductionmentioning
confidence: 99%