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.

Written by prominent experts in the field, this monograph provides the first comprehensive, unified presentation of the structural, algorithmic and applied aspects of the theory of Boolean functions. The book focuses on algebraic representations of Boolean functions, especially disjunctive and conjunctive normal form representations. This framework looks at the fundamental elements of the theory (Boolean equations and satisfiability problems, prime implicants and associated short representations, dualization), an in-depth study of special classes of Boolean functions (quadratic, Horn, shellable, regular, threshold, read-once functions and their characterization by functional equations) and two fruitful generalizations of the concept of Boolean functions (partially defined functions and pseudo-Boolean functions). Several topics are presented here in book form for the first time. Because of the depth and breadth and its emphasis on algorithms and applications, this monograph will have special appeal for researchers and graduate students in discrete mathematics, operations research, computer science, engineering and economics.

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

"Utilizing a systematic, broad approach, Introduction to the Comparative Method With Boolean Algebra gives readers the logical foundations of comparison with guided applications and is the ultimate comparative method text covering each of the current and most important issues in the field. Author Daniele Caramani discusses the elements of scientific research, including Mill's methods, Boolean algebra, classification and typologization, and necessary and sufficient conditions, and how these apply to concrete research in the social sciences." "This text is indispensable for upper-level undergraduate and graduate students as well as researchers interested in methodology, behavioral and social sciences, history, and logic."--BOOK JACKET.

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.

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.

Boolean functions are the building blocks of symmetric cryptographic systems. Symmetrical cryptographic algorithms are fundamental tools in the design of all types of digital security systems (i.e. communications, financial and e-commerce).Cryptographic Boolean Functions and Applications is a concise reference that shows how Boolean functions are used in cryptography. Currently, practitioners who need to apply Boolean functions in the design of cryptographic algorithms and protocols need to patch together needed information from a variety of resources (books, journal articles and other sources). This book compiles the key essential information in one easy to use, step-by-step reference. Beginning with the basics of the necessary theory the book goes on to examine more technical topics, some of which are at the frontier of current research. Serves as a complete resource for the successful design or implementation of cryptographic algorithms or protocols using Boolean functions Provides engineers and scientists with a needed reference for the use of Boolean functions in cryptography Addresses the issues of cryptographic Boolean functions theory and applications in one concentrated resource Organized logically to help the reader easily understand the topic