In part 2, games are introduced, and used to axiomatise various classes of algebras. Part 3 discusses approximations to representability, using bases, relation algebra reducts, and relativised representations. Part 4 presents some constructions of relation algebras, including Monk algebras and the 'rainbow construction', and uses them to show that various classes of representable algebras are non-finitely axiomatisable or even non-elementary. Part 5 shows that the representability problem for finite relation algebras is undecidable, and then in contrast proves some finite base property results. Part 6 contains a condensed summary of the book, and a list of problems. There are more than 400 exercises. P The book is generally self-contained on relation algebras and on games, and introductory text is scattered throughout. Some familiarity with elementary aspects of first-order logic and set theory is assumed, though many of the definitions are given.-

This book constitutes the proceedings of the 20th International Conference on Relational and Algebraic Methods in Computer Science, RAMiCS 2023, which took place in Augsburg, Germany, during April 3–6, 2023. The 17 papers presented in this book were carefully reviewed and selected from 26 submissions. They deal with the development and dissemination of relation algebras, Kleene algebras, and similar algebraic formalisms. Topics covered range from mathematical foundations to applications as conceptual and methodological tools in computer science and beyond. Apart from the submitted articles, this volume features the abstracts of the presentations of the three invited speakers.

Accessible but rigorous, this outstanding text encompasses all of the topics covered by a typical course in elementary abstract algebra. Its easy-to-read treatment offers an intuitive approach, featuring informal discussions followed by thematically arranged exercises. This second edition features additional exercises to improve student familiarity with applications. 1990 edition.

Infinity can feature in games in various forms: we can play games of infinite length, with infinitely many players, or allow for infinitely many moves or strategies. Games of infinite length have been thoroughly investigated by mathematicians ard have played a central role in mathematical logic. However, their applications go far beyond mathematics: they feature prominently in theoretical computer science, philosophical "Gedankenxperiments", as limit cases in economical applications, and in many other applications. The conference "Foundations of the Formal Sciences V" focused on games of infinite length, but was very open to include other notions of infinity in games as well. It brought together researchers from the various areas that employ infinitary game techniques to talk about similarities and dissimilarities of the different approaches and develop cross-cultural bridges. This volume contains the fully refereed proceedings of the conference and provides a healthy and interesting mixture of research papers and surveys for a broad audience.

The American Mathematical Monthly recommended this advanced undergraduate-level text for teacher education. It starts with groups, rings, fields, and polynomials and advances to Galois theory, radicals and roots of unity, and solution by radicals. Numerous examples, illustrations, commentaries, and exercises enhance the text, along with 13 appendices. 1971 edition.