Foundations of Computation is a free textbook for a one-semester course in theoretical computer science. It has been used for several years in a course at Hobart and William Smith Colleges. The course has no prerequisites other than introductory computer programming. The first half of the course covers material on logic, sets, and functions that would often be taught in a course in discrete mathematics. The second part covers material on automata, formal languages and grammar that would ordinarily be encountered in an upper level course in theoretical computer science.

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.

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

REA’s Essentials provide quick and easy access to critical information in a variety of different fields, ranging from the most basic to the most advanced. As its name implies, these concise, comprehensive study guides summarize the essentials of the field covered. Essentials are helpful when preparing for exams, doing homework and will remain a lasting reference source for students, teachers, and professionals. Boolean Algebra includes set theory, sentential calculus, fundamental ideas of Boolean algebras, lattices, rings and Boolean algebras, the structure of a Boolean algebra, and Boolean algebra in communication systems.

This third edition, now available in paperback, is a follow up to the author's classic Boolean-Valued Models and Independence Proofs in Set Theory,. It provides an exposition of some of the most important results in set theory obtained in the 20th century: the independence of the continuum hypothesis and the axiom of choice. Aimed at graduate students and researchers in mathematics, mathematical logic, philosophy, and computer science, the third edition has been extensively updated with expanded introductory material, new chapters, and a new appendix on category theory. It covers recent developments in the field and contains numerous exercises, along with updated and increased coverage of the background material. This new paperback edition includes additional corrections and, for the first time, will make this landmark text accessible to students in logic and set theory.

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.