2011
DOI: 10.1007/s00233-011-9327-5
|View full text |Cite
|
Sign up to set email alerts
|

Commutative semigroups with cancellation law: a representation theorem

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0

Year Published

2013
2013
2022
2022

Publication Types

Select...
4
1

Relationship

1
4

Authors

Journals

citations
Cited by 5 publications
(6 citation statements)
references
References 11 publications
0
6
0
Order By: Relevance
“…The following theorem is a corollary from Theorem 2.7 in [10], which was proved for commutative semigroups. The proof is easy and we omit it.…”
Section: Definition 27mentioning
confidence: 88%
See 2 more Smart Citations
“…The following theorem is a corollary from Theorem 2.7 in [10], which was proved for commutative semigroups. The proof is easy and we omit it.…”
Section: Definition 27mentioning
confidence: 88%
“…In this section first we recall (Proposition 2.4 and Theorem 2.6) main results from [10] concerning commutative semigroup S with 0 satisfying the law of cancellation and a semigroup symmetry T on S. Definition 2.1 We say that S is 2-torsion-free if s + s = t + t implies s = t. We say that a semigroup symmetry T is 2-divisible if for any s ∈ S there exists t ∈ S such that s + Ts = t + t.…”
Section: Decomposition Of Quotient Groupmentioning
confidence: 99%
See 1 more Smart Citation
“…Moreover, let the following conditions be satisfied: Proof. For k ∈ N we have 2(i) [27] and Proposition 3.5 [15]).…”
Section: Cancellation Law In An Ordered Semigroup With An Operator Of...mentioning
confidence: 99%
“…This lemma turned out to be a basic tool in various fields and hundreds of papers have used it by now. For instance, in nonsmooth analysis [7][8][9]14,[18][19][20]34], optimization theory [15,36,38], theory of convex sets and functions [10,12,16,17,[23][24][25][26][27][28][29][30][31][32][33]35,40,59,60], set-valued analysis [2,13,37,39,41,[44][45][46]48], set-valued differential equations [3,4,11,22,43,49], set-valued functional equations [6,42,[51][52][53]…”
Section: Introductionmentioning
confidence: 99%