Abstract
A semigroup S is an associative groupoid; that is, a groupoid such that the associative law
holds for all x, y, z in S. [Many authors, including most of those writing in French, use the term “demigroup” for an associative groupoid; these authors reserve “semigroup” for what we shall call a cancellation semigroup. Other terms are “monoid” (Bourbaki) and “associative system” (Russian authors). The present terminology is standard in English and German.]
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1971 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Bruck, R.H. (1971). The Associative Law. In: A Survey of Binary Systems. Ergebnisse der Mathematik und ihrer Grenzgebiete, vol NF 20. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-43119-1_2
Download citation
DOI: https://doi.org/10.1007/978-3-662-43119-1_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-42837-5
Online ISBN: 978-3-662-43119-1
eBook Packages: Springer Book Archive