Abstract
dc:descriptionDefinition 1.1. The ordered pair (S,*) is a semi-group iff S is a set and * is an associative binary operation (multiplication) on S. Notation. A semigroup (S,*) will ordinarily be referred to by the set S, with the multiplication understood. In other words, if (a,b)e SX , then *[(a,b)] = a*b = ab. The proof of the following proposition is found on p. 4 of Introduction to Semigroups, by Mario Petrich. Proposition 1.2. Every semigroup S satisfies the general associative law.
Degree
thesis:*- Grantor dc:publisher
- North Texas State University
- Year dc:date
- 1978
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Winton, Richard Alan
- Contributors dc:contributor
-
- Lau, Yiu-Wa August
- Dawson, David Fleming
Subjects
dc:subject × 3Rights
dc:rights- Statement dc:rights
-
- Public
- Winton, Richard Alan
- Copyright
- Copyright is held by the author, unless otherwise noted. All rights reserved.
- Language dc:language
- English
Identifiers
dc:identifier.*- Identifier
-
local-cont-no: 1002772453-Winton
call-no: 379 N81 no.5559
untcat: b1225142
oclc: 5249977
ark: ark:/67531/metadc504365