No label defined (Q3290722)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3171975
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3171975 |
Statements
1962
0 references
general algebra
0 references
groupoids
0 references
semigroups
0 references
groups
0 references
universal algebra
0 references
groups with multiple operators
0 references
lattices
0 references
operator groups
0 references
modules
0 references
linear algebra
0 references
ordered groups
0 references
topological groups
0 references
valuations
0 references
0.7892242670059204
0 references
0.7841008305549622
0 references
0.7750032544136047
0 references
Throughout this book, the style is both pleasant and lucid, the choice of topics both apt and refreshing. Chapter 2 introduces groupoids, semigroups and groups; Chapter 3, universal algebra and groups with multiple operators [\textit{P. J. Higgins}, Proc. Lond. Math. Soc. (3) 6, 366--416 (1956; Zbl 0073.01704)]; Chapter 4, lattices; Chapter 5, operator groups, modules and linear algebra; Chapter 6, ordered and topological groups along with valuations. To give an indication of the richness of content, we append a detailed list of topics for Chapter 1: sets, mappings, inverses, axiom of choice; binary relations on a set, their products, inverses, the identity relation, the sharing of reflexivity, transitivity, symmetry and/or anti-symmetry by a relation and its inverse, the induced binary relation in a subset, \(n\)-ary relations; equivalence relations, partitions, unions and intersections of equivalence relations, the quotient of a set by an equivalence relation; partial and linear ordering with examples, order isomorphisms, embedding by an order isomorphism, the realization of a partially ordered set as a set of subsets under inclusion, inverse order isomorphisms; the minimal condition, the descending chain condition, the induction principle (in a most elegant form for partially ordered sets), the equivalence of these three conditions, construction of functions by induction, well ordering, maximal elements; upper and lower bounds of subsets, maximal chains, the equivalence of the axiom of choice, Zermelo's theorem, Hausdorff's theorem and the theorem of Kuratowski and Zorn.
0 references