Orignally published: Englewood Cliffs, N.J.: Prentice-Hall, 1962.

Introductory treatment begins with set theory and fundamentals of Boolean algebra, proceeding to concise accounts of applications to symbolic logic, switching circuits, relay circuits, binary arithmetic, and probability theory. 1961 edition.

Concise text begins with overview of elementary mathematical concepts and outlines theory of Boolean algebras; defines operators for elimination, division, and expansion; covers syllogistic reasoning, solution of Boolean equations, functional deduction. 1990 edition.

Here is an introduction to modern logic that differs from others by treating logic from an algebraic perspective. What this means is that notions and results from logic become much easier to understand when seen from a familiar standpoint of algebra. The presentation, written in the engaging and provocative style that is the hallmark of Paul Halmos, from whose course the book is taken, is aimed at a broad audience, students, teachers and amateurs in mathematics, philosophy, computer science, linguistics and engineering; they all have to get to grips with logic at some stage. All that is needed.

Digital technology has become ubiquitous in our modern society, to the extent that we risk of being left behind and becoming cut-off if we do not adopt it! This KES aims to show why digital technology is becoming so appealing, what digital data are, what operations can be performed on them, and how digital logic theory can be used to systematically formulate solutions to several practical problems. As we become immersed in the 0's and 1's of a digital world, knowing the differences between the way our smart digital companions work and how we humans interpret information is of high relevance today, irrespective of the wake of life we find ourselves in with respect to digital technology. Customers are increasingly asked to understand digital terms like bits, bytes, GB, GHz and TB when selecting their next laptop or smartphone, and for anyone aspiring to get into this rapidly evolving environment as a professional, the basics and principles are a must.The underlying digital principles are also found to be a useful asset for learning computer programming, as it enables to understand the machine level operations of the computer, and hence equips one to understand unexpected behaviors of a piece of code and in troubleshooting bugs.

Outstanding features include: a history of mathematical logic, an explanation of the logic of digital circuits, and hands-on exercises and examples.

Confusing Textbooks? Missed Lectures? Not Enough Time? Fortunately for you, there's Schaum's Outlines. More than 40 million students have trusted Schaum's to help them succeed in the classroom and on exams. Schaum's is the key to faster learning and higher grades in every subject. Each Outline presents all the essential course information in an easy-to-follow, topic-by-topic format. You also get hundreds of examples, solved problems, and practice exercises to test your skills. This Schaum's Outline gives you Practice problems with full explanations that reinforce knowledge Coverage of the most up-to-date developments in your course field In-depth review of practices and applications Fully compatible with your classroom text, Schaum's highlights all the important facts you need to know. Use Schaum's to shorten your study time-and get your best test scores! Schaum's Outlines-Problem Solved.

This presentation on the basics of Boolean algebra has ranked among the fundamental books on this important subject in mathematics and computing science since its initial publication in 1963. Concise and informal as well as systematic, the text draws upon lectures delivered by Professor Halmos at the University of Chicago to cover many topics in brief individual chapters. The approach is suitable for advanced undergraduates and graduate students in mathematics. Starting with Boolean rings and algebras, the treatment examines fields of sets, regular open sets, elementary relations, infinite operations, subalgebras, homomorphisms, free algebras, ideals and filters, and the homomorphism theorem. Additional topics include measure algebras, Boolean spaces, the representation theorem, duality for ideals and for homomorphisms, Boolean measure spaces, isomorphisms of factors, projective and injective algebras, and many other subjects. Several chapters conclude with stimulating exercises; the solutions are not included.