Mathematical fuzzy logic as a tool for the treatment of vague information
Information Sciences—Informatics and Computer Science: An International Journal
Information Sciences—Informatics and Computer Science: An International Journal
Information Sciences: an International Journal
Boolean filters and positive implicative filters of residuated lattices
Information Sciences: an International Journal
Triangle algebras: A formal logic approach to interval-valued residuated lattices
Fuzzy Sets and Systems
Fuzzy filters and fuzzy prime filters of bounded Rl-monoids and pseudo BL-algebras
Information Sciences: an International Journal
A characterization of interval-valued residuated lattices
International Journal of Approximate Reasoning
Advances and challenges in interval-valued fuzzy logic
Fuzzy Sets and Systems
Filters of residuated lattices and triangle algebras
Information Sciences: an International Journal
On filter theory of residuated lattices
Information Sciences: an International Journal
Rough implication operator based on strong topological rough algebras
Information Sciences: an International Journal
Robustness of interval-valued fuzzy inference
Information Sciences: an International Journal
The standard completeness of interval-valued monoidal t-norm based logic
Information Sciences: an International Journal
Hi-index | 0.07 |
Triangle algebras are equationally defined structures that are equivalent with certain residuated lattices on a set of intervals, which are called interval-valued residuated lattices (IVRLs). Triangle algebras have been used to construct triangle logic (TL), a formal fuzzy logic that is sound and complete w.r.t. the class of IVRLs. In this paper, we prove that the so-called pseudo-prelinear triangle algebras are subdirect products of pseudo-linear triangle algebras. This can be compared with MTL-algebras (prelinear residuated lattices) being subdirect products of linear residuated lattices. As a consequence, we are able to prove the pseudo-chain completeness of pseudo-linear triangle logic (PTL), an axiomatic extension of TL introduced in this paper. This kind of completeness is the analogue of the chain completeness of monoidal T-norm based logic (MTL). This result also provides a better insight in the structure of triangle algebras; it enables us, amongst others, to prove properties of pseudo-prelinear triangle algebras more easily. It is known that there is a one-to-one correspondence between triangle algebras and couples (L,@a), in which L is a residuated lattice and @a an element in that residuated lattice. We give a schematic overview of some properties of pseudo-prelinear triangle algebras (and a number of others that can be imposed on a triangle algebra), and the according necessary and sufficient conditions on L and @a.