2014
DOI: 10.1142/s1793557114500065
|View full text |Cite
|
Sign up to set email alerts
|

Representations of Ordered Dimonoids by Binary Relations

Abstract: We introduce the notion of an ordered dimonoid and prove that every ordered dimonoid can be exactly represented as an ordered dimonoid of binary relations. Also we find sufficient conditions under which an ordered dimonoid is isomorphic to some ordered dimonoid of reflexive (or transitive) binary relations.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3

Citation Types

0
4
0
1

Year Published

2016
2016
2024
2024

Publication Types

Select...
9

Relationship

0
9

Authors

Journals

citations
Cited by 9 publications
(5 citation statements)
references
References 4 publications
0
4
0
1
Order By: Relevance
“…Thus, semigroups and doppelsemigroups can be characterized as n-tuple semigroups. The study of doppelsemigroups was initiated by the author in [28] and then it was continued in [5,6,25,30,33,35,36,41,44]. Note that doppelalgebras introduced by Richter [17] are linear analogs of doppelsemigroups.…”
Section: Introductionmentioning
confidence: 99%
“…Thus, semigroups and doppelsemigroups can be characterized as n-tuple semigroups. The study of doppelsemigroups was initiated by the author in [28] and then it was continued in [5,6,25,30,33,35,36,41,44]. Note that doppelalgebras introduced by Richter [17] are linear analogs of doppelsemigroups.…”
Section: Introductionmentioning
confidence: 99%
“…Representations of ordered doppelsemigroups by binary relations were studied by Yu. Zhuchok and J. Koppitz, see [23].…”
Section: Introductionmentioning
confidence: 99%
“…Recall that an algebra (D, , ) with two binary associative operations and is called a dimonoid if for all x, y, z ∈ D the following conditions hold: Dimonoids play a prominent role in problems from the theory of Leibniz algebras. A more detailed information on dimonoids, free dimonoid constructions and examples of dimonoids can be found, e.g., in [2]- [5].…”
Section: Introductionmentioning
confidence: 99%