by Lai Chi-Keung. / Bibliography: leaves 45-46 / Thesis (M.Ph.)--Chinese University of Hong Kong, 1985

by Chan Mui-wong. / Bibliography: leaves 56-57 / Thesis (M.Ph.)--Chinese University of Hong Kong, 1985

by Luk Mee-Lin. / Thesis (M.Phil.)--Chinese University of Hong Kong, 1989. / Bibliography: leaves [1-3] (second group)

Tso Kai-sing. / Thesis (M.Phil.)--Chinese University of Hong Kong. / Bibliography: leaves 32.

Thesis (M.Phil.)--Chinese University of Hong Kong. / Bibliography: leaves 57-58.

Kwan Si-yue. / Thesis (M.Phil.)--Chinese University of Hong Kong. / Bibliography: leaf [32]

No description available.

Thesis--University of Florida. / Description based on print version record. Typescript. Vita. Bibliography: leaves 81-82.

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 study of semigroups discusses groups, ideals, relations on semigroups, and relation classes in semigroups. Each topic is covered in some detail; but since this is a general study of semigroups, no topic dominates the paper. The definitions, theorems, and corollaries are supplied by Dr. August Lau, and all proofs are the work of Ms. Bryant.