The textbook introduces important topics in order and lattice theory and discusses significant applications in computer science. The order and lattice theory is developed into the algebraic theory of relations, known as relational algebra. Furthermore, the book focuses on computer science applications, primarily the formal development of algorithms for discrete problems. Examples from order and lattice theory connect back to the first part of the book.

Content
Orders and lattices - special classes of lattices - fixed point theory with applications - completions - well-ordered sets and the axiom of choice - some computer science applications of orders and lattices - relational algebra - structure-preserving functions - relational algebraic description of data structures - reachability and connectivity - computation of kernels - equivalence classes and canonical epimorphisms - questions from order and lattice theory.

Target Audience
Computer scientists, mathematicians, and students in bachelor's or master's programs from the second year onwards.

Author
Prof. Dr. Rudolf Berghammer teaches and conducts research at the University of Kiel, Institute of Computer Science.