1. Introduction 2. Background material Part 1. Introducing generative complexity 3. Definitions and examples 4. Semilattices and lattices 5. Varieties with a large number of models 6. Upper bounds 7. Categorical invariants Part 2. Varieties with few models 8. Types 4 or 5 need not apply 9. Semisimple may apply 10. Permutable may also apply 11. Forcing modular behavior 12. Restricting solvable behavior 13. Varieties with very few models 14. Restricting nilpotent behavior 15. Decomposing finite algebras 16. Restricting affine behavior 17. A characterization theorem Part 3. Conclusions 18. Application to groups and rings 19. Open problems 20. Tables
Summary
Introduction Background material Part 1. Introducing Generative Complexity: Definitions and examples Semilattices and lattices Varieties with a large number of models Upper bounds Categorical invariants Part 2. Varieties with Few Models: Types 4 or 5 need not apply Semisimple may apply Permutable may also apply Forcing modular behavior Restricting solvable behavior Varieties with very few models Restricting nilpotent behavior Decomposing finite algebras Restricting affine behavior A characterization theorem Part 3. Conclusions: Application to groups and rings Open problems Tables Bibliography
Notes
"Volume 175, number 828 (end of volume)."
Bibliography
Includes bibliographical references (pages 157-159)
