Binary relations and reduced hypergroups
چکیده
چکیدهای برای این سند ثبت نشده است.
چکیدهای برای این سند ثبت نشده است.
Different partial hypergroupoids are associated with binary relations defined on a set H. In this paper we find sufficient and necessary conditions for these hypergroupoids in order to be reduced hypergroups. Given two binary relations and on H we investigate when the hypergroups
the concept of -semihypergroups is a generalization of semigroups, a generalization of semihypergroups and a generalization of -semigroups. in this paper, we study the concept of semiprime ideals in a -semihypergroup and prove some results. also, we introduce the notion of
In this paper, we introduce and study the notion of a partial n-hypergroupoid, associated with a binary relation. Some important results concerning Rosenberg partial hypergroupoids, induced by relations, are generalized to the case of n-hypergroupoids. Then, n-hypergroups associa
We consider the on-line learning problem for binary relations de ned over two nite sets, each clustered into a relatively small number k; l of `types' (such a relation is termed a (k; l)-binary relation), extending the models of [GRS93][GW93]. We investigate the learning complexi
Let Λ be a signature and A = (A, Λ) be an algebra. We say that A is an algebra of binary relations if A ⊆ P(U × U) for some set U and each operation in Λ is interpreted as a natural operation on relations. 0 is the empty set. Other possible operations include reexive-transitive c
We establish the undecidability of representability and of finite representability as algebras of binary relations in a wide range of signatures. In particular, representability and finite representability are undecidable for Boolean monoids and lattice ordered monoids, while rep