Universal Algebra Algebraic Logic And Databases

Modern algebra, which not long ago seemed to be a science divorced from real life, now has numerous applications. Many fine algebraic structures are endowed with meaningful contents. Now and then practice suggests new and unexpected structures enriching algebra. This does not mean that algebra has become merely a tool for applications. Quite the contrary, it significantly benefits from the new connections. The present book is devoted to some algebraic aspects of the theory of databases. It consists of three parts. The first part contains information about universal algebra, algebraic logic is the subject of the second part, and the third one deals with databases. The algebraic material of the flI'St two parts serves the common purpose of applying algebra to databases. The book is intended for use by mathematicians, and mainly by algebraists, who realize the necessity to unite theory and practice. It is also addressed to programmers, engineers and all potential users of mathematics who want to construct their models with the help of algebra and logic. Nowadays, the majority of professional mathematicians work in close cooperation with representatives of applied sciences and even industrial technology. It is neces sary to develop an ability to see mathematics in different particular situations. One of the tasks of this book is to promote the acquisition of such skills.

The present book was conceived as an introduction for the user of universal algebra, rather than a handbook for the specialist, but when the first edition appeared in 1965, there were practically no other books entir~ly devoted to the subject, whether introductory or specialized. Today the specialist in the field is well provided for, but there is still a demand for an introduction to the subject to suit the user, and this seemed to justify a reissue of the book. Naturally some changes have had to be made; in particular, I have corrected all errors that have been brought to my notice. Besides errors, some obscurities in the text have been removed and the references brought up to date. I should like to express my thanks to a number of correspondents for their help, in particular C. G. d'Ambly, W. Felscher, P. Goralcik, P. J. Higgins, H.-J. Hoehnke, J. R. Isbell, A. H. Kruse, E. J. Peake, D. Suter, J. S. Wilson. But lowe a special debt to G. M. Bergman, who has provided me with extensive comments. particularly on Chapter VII and the supplementary chapters. I have also con sulted reviews of the first edition, as well as the Italian and Russian translations.

A new model-theoretic approach to universal algebra is offered in this book. Written for computer scientists, it presents a systematic development of the methods and results of universal algebra that are useful in a variety of applications in computer science. The notation is simple and the concepts are clearly presented. The book concerns the algebraic characterization of axiomatic classes of algebras (equational, implicational, and universal Horn classes) by closure operators generalizing the famous Birkhoff Variety Theorem, and the algebraic characterization of the related theories. The book also presents a thorough study of term rewriting systems. Besides basic notions, the Knuth-Bendix completion procedure and termination proof methods are considered. A third main topic is that of fixpoint techniques and complete ordered algebras. Algebraic specifications of abstract data types and algebraic semantics of recursive program schemes are treated as applications. The book is self-contained and suitable both as a textbook for graduate courses and as a reference for researchers.

Starting with the most basic notions, Universal Algebra: Fundamentals and Selected Topics introduces all the key elements needed to read and understand current research in this field. Based on the author's two-semester course, the text prepares students for research work by providing a solid grounding in the fundamental constructions and concepts o