Definition 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.
The UNT Libraries serve the university and community by providing access to physical and online collections, fostering information literacy, supporting academic research, and much, much more.
Definition 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.
This thesis is part of the following collection of related materials.
UNT Theses and Dissertations
Theses and dissertations represent a wealth of scholarly and artistic content created by masters and doctoral students in the degree-seeking process. Some ETDs in this collection are restricted to use by the UNT community.
