Angielski
This is the first introductory textbook on ordered sets and lattices, and covers both the basic theory and its applications. The importance of ordered structures has been increasingly recognised in recent years due to an explosion of interest in computer science and all areas of discrete mathematics. The authors provide a thorough introduction to ordered sets, lattices, distributive lattices and Boolean algebras. Ordered sets, and in particular lattices, can be represented pictorially, and this key feature is emphasised throughout. Lattices are also considered as algebraic structures and their study from this viewpoint reinforces ideas encountered in the theory of groups and rings. The representation of distributive lattices by ordered topological spaces is presented; a self-contained treatment of the requisite topology is included. Two chapters are devoted to topics with application to computer science. These cover complete partial orders, domains (including their relation to information systems), and fixpoint theory. Another chapter deals with formal concept analysis - a new and important application of lattice theory of interest to mathematicians and social scientists. Prerequisites are minimal; all that is assumed is exposure to the notation of set theory and elementary abstract algebra. The numerous classroom-tested exercises will make the book especially useful for course accompaniment, but it will also be valuable as a background reference for mathematicians, logicians and computer scientists.
