Currently displaying 1 – 14 of 14

Showing per page

Order by Relevance | Title | Year of publication

Lattice valued intuitionistic fuzzy sets

Tadeusz GerstenkornAndreja Tepavĉević — 2004

Open Mathematics

In this paper a new definition of a lattice valued intuitionistic fuzzy set (LIFS) is introduced, in an attempt to overcome the disadvantages of earlier definitions. Some properties of this kind of fuzzy sets and their basic operations are given. The theorem of synthesis is proved: For every two families of subsets of a set satisfying certain conditions, there is an lattice valued intuitionistic fuzzy set for which these are families of level sets.

On distributive trices

Kiyomitsu HoriuchiAndreja Tepavčević — 2001

Discussiones Mathematicae - General Algebra and Applications

A triple-semilattice is an algebra with three binary operations, which is a semilattice in respect of each of them. A trice is a triple-semilattice, satisfying so called roundabout absorption laws. In this paper we investigate distributive trices. We prove that the only subdirectly irreducible distributive trices are the trivial one and a two element one. We also discuss finitely generated free distributive trices and prove that a free distributive trice with two generators has 18 elements.

Equivalent fuzzy sets

Branimir ŠešeljaAndreja Tepavčević — 2005


Necessary and sufficient conditions under which two fuzzy sets (in the most general, poset valued setting) with the same domain have equal families of cut sets are given. The corresponding equivalence relation on the related fuzzy power set is investigated. Relationship of poset valued fuzzy sets and fuzzy sets for which the co-domain is Dedekind-MacNeille completion of that posets is deduced.

Fuzzy sets (in)equations with a complete codomain lattice

Vanja StepanovićAndreja Tepavčević — 2022


The paper applies some properties of the monotonous operators on the complete lattices to problems of the existence and the construction of the solutions to some fuzzy relational equations, inequations, and their systems, taking a complete lattice for the codomain lattice. The existing solutions are extremal - the least or the greatest, thus we prove some extremal problems related to fuzzy sets (in)equations. Also, some properties of upper-continuous lattices are proved and applied to systems of...

Cardinality of height function’s range in case of maximally many rectangular islands - computed by cuts

Eszter HorváthBranimir ŠešeljaAndreja Tepavčević — 2013

Open Mathematics

We deal with rectangular m×n boards of square cells, using the cut technics of the height function. We investigate combinatorial properties of this function, and in particular we give lower and upper bounds for the number of essentially different cuts. This number turns out to be the cardinality of the height function’s range, in case the height function has maximally many rectangular islands.

A note on triangular schemes for weak congruences

Ivan ChajdaBranimir ŠešeljaAndreja Tepavčević — 2005

Czechoslovak Mathematical Journal

Some geometrical methods, the so called Triangular Schemes and Principles, are introduced and investigated for weak congruences of algebras. They are analogues of the corresponding notions for congruences. Particular versions of Triangular Schemes are equivalent to weak congruence modularity and to weak congruence distributivity. For algebras in congruence permutable varieties, stronger properties—Triangular Principles—are equivalent to weak congruence modularity and distributivity.

Cut properties of resemblance

The resemblance relation is used to reflect some real life situations for which a fuzzy equivalence is not suitable. We study the properties of cuts for such relations. In the case of a resemblance on a real line E we show that it determines a special family of crisp functions closely connected to its cut relations. Conversely, we present conditions which should be satisfied by a collection of real functions in E in order that this collection determines a resemblance relation.

Congruences and homomorphisms on Ω -algebras

The topic of the paper are Ω -algebras, where Ω is a complete lattice. In this research we deal with congruences and homomorphisms. An Ω -algebra is a classical algebra which is not assumed to satisfy particular identities and it is equipped with an Ω -valued equality instead of the ordinary one. Identities are satisfied as lattice theoretic formulas. We introduce Ω -valued congruences, corresponding quotient Ω -algebras and Ω -homomorphisms and we investigate connections among these notions. We prove...

Poset-valued preference relations

In decision processes some objects may not be comparable with respect to a preference relation, especially if several criteria are considered. To provide a model for such cases a poset valued preference relation is introduced as a fuzzy relation on a set of alternatives with membership values in a partially ordered set. We analyze its properties and prove the representation theorem in terms of particular order reversing involution on the co-domain poset. We prove that for every set of alternatives...

Page 1

Download Results (CSV)