This HTML5 document contains 49 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
dbnaryhttp://kaiko.getalp.org/dbnary#
skoshttp://www.w3.org/2004/02/skos/core#
ontolexhttp://www.w3.org/ns/lemon/ontolex#
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
xsdhhttp://www.w3.org/2001/XMLSchema#
dbnary-enghttp://kaiko.getalp.org/dbnary/eng/

Statements

Subject Item
dbnary-eng:__ws_1_semigroup__Noun__1
rdf:type
ontolex:LexicalSense
dbnary:hypernym
dbnary-eng:magma
dbnary:hyponym
dbnary-eng:group dbnary-eng:monoid
dbnary:senseNumber
1
skos:example
_:vb17592450 _:vb17592451 _:vb17592449 _:vb17592454 _:vb17592452 _:vb17592453 _:vb17592446 _:vb17592447 _:vb17592445 _:vb6903706 _:vb6903707 _:vb6903708
skos:definition
_:vb17592456 _:vb17592455 _:vb17592448 _:vb6903705
Subject Item
_:vb6903705
rdf:value
(mathematics) Any set for which there is a binary operation that is closed and associative.
Subject Item
_:vb6903706
rdf:value
If a semigroup S contains a zeroid, then every left zeroid is also a right zeroid, and vice versa, and the set K of all the zeroids of S is the kernel of S.
dcterms:bibliographicCitation
1961, Alfred Hoblitzelle Clifford, G. B. Preston, The Algebraic Theory of Semigroups, page 70:
Subject Item
_:vb6903707
rdf:value
It follows naturally that various classes of ordered sets can be characterized by semigroup properties of endomorphism semigroups.
dcterms:bibliographicCitation
1988, A. Ya Aǐzenshtat, Boris M. Schein (translator), On Ideals of Semigroups of Endomorphisms, Ben Silver (editor), Nineteen Papers on Algebraic Semigroups, American Mathematical Society Translations, Series 2, Volume 139, page 11,
Subject Item
_:vb6903708
rdf:value
If one considers the variety of semigroups, one has the binary operation of multiplication defined on every semigroup.
dcterms:bibliographicCitation
2012, Jorge Almeida, Benjamin Steinberg, “Syntactic and Global Subgroup Theory: A Synthesis Approach”, in Jean-Camille Birget, Stuart Margolis, John Meakin, Mark V. Sapir, editors, Algorithmic Problems in Groups and Semigroups, page 5:
Subject Item
_:vb17592445
rdf:value
If a semigroup S contains a zeroid, then every left zeroid is also a right zeroid, and vice versa, and the set K of all the zeroids of S is the kernel of S.
dcterms:bibliographicCitation
1961, Alfred Hoblitzelle Clifford, G. B. Preston, The Algebraic Theory of Semigroups, page 70:
Subject Item
_:vb17592446
rdf:value
It follows naturally that various classes of ordered sets can be characterized by semigroup properties of endomorphism semigroups.
dcterms:bibliographicCitation
1988, A. Ya Aǐzenshtat, Boris M. Schein (translator), On Ideals of Semigroups of Endomorphisms, Ben Silver (editor), Nineteen Papers on Algebraic Semigroups, American Mathematical Society Translations, Series 2, Volume 139, page 11,
Subject Item
_:vb17592447
rdf:value
If one considers the variety of semigroups, one has the binary operation of multiplication defined on every semigroup.
dcterms:bibliographicCitation
2012, Jorge Almeida, Benjamin Steinberg, “Syntactic and Global Subgroup Theory: A Synthesis Approach”, in Jean-Camille Birget, Stuart Margolis, John Meakin, Mark V. Sapir, editors, Algorithmic Problems in Groups and Semigroups, page 5:
Subject Item
_:vb17592448
rdf:value
(mathematics) Any set for which there is a binary operation that is closed and associative.
Subject Item
_:vb17592449
rdf:value
If a semigroup S contains a zeroid, then every left zeroid is also a right zeroid, and vice versa, and the set K of all the zeroids of S is the kernel of S.
dcterms:bibliographicCitation
1961, Alfred Hoblitzelle Clifford, G. B. Preston, The Algebraic Theory of Semigroups, page 70:
Subject Item
_:vb17592450
rdf:value
If a semigroup S contains a zeroid, then every left zeroid is also a right zeroid, and vice versa, and the set K of all the zeroids of S is the kernel of S.
dcterms:bibliographicCitation
1961, Alfred Hoblitzelle Clifford, G. B. Preston, The Algebraic Theory of Semigroups, page 70:
Subject Item
_:vb17592451
rdf:value
It follows naturally that various classes of ordered sets can be characterized by semigroup properties of endomorphism semigroups.
dcterms:bibliographicCitation
1988, A. Ya Aǐzenshtat, Boris M. Schein (translator), On Ideals of Semigroups of Endomorphisms, Ben Silver (editor), Nineteen Papers on Algebraic Semigroups, American Mathematical Society Translations, Series 2, Volume 139, page 11,
Subject Item
_:vb17592452
rdf:value
If one considers the variety of semigroups, one has the binary operation of multiplication defined on every semigroup.
dcterms:bibliographicCitation
2012, Jorge Almeida, Benjamin Steinberg, “Syntactic and Global Subgroup Theory: A Synthesis Approach”, in Jean-Camille Birget, Stuart Margolis, John Meakin, Mark V. Sapir, editors, Algorithmic Problems in Groups and Semigroups, page 5:
Subject Item
_:vb17592453
rdf:value
It follows naturally that various classes of ordered sets can be characterized by semigroup properties of endomorphism semigroups.
dcterms:bibliographicCitation
1988, A. Ya Aǐzenshtat, Boris M. Schein (translator), On Ideals of Semigroups of Endomorphisms, Ben Silver (editor), Nineteen Papers on Algebraic Semigroups, American Mathematical Society Translations, Series 2, Volume 139, page 11,
Subject Item
_:vb17592454
rdf:value
If one considers the variety of semigroups, one has the binary operation of multiplication defined on every semigroup.
dcterms:bibliographicCitation
2012, Jorge Almeida, Benjamin Steinberg, “Syntactic and Global Subgroup Theory: A Synthesis Approach”, in Jean-Camille Birget, Stuart Margolis, John Meakin, Mark V. Sapir, editors, Algorithmic Problems in Groups and Semigroups, page 5:
Subject Item
_:vb17592455
rdf:value
(mathematics) Any set for which there is a binary operation that is closed and associative.
Subject Item
_:vb17592456
rdf:value
(mathematics) Any set for which there is a binary operation that is closed and associative.