IN 1959 I lectured on Boolean algebras at the University of Chicago. A mimeographed version of the notes on which the lectures were based circulated for about two years; this volume contains those notes, corrected and revised. Most of the corrections were suggested by Peter Crawley. To judge by his detailed and precise suggestions, he must have read every word, checked every reference, and weighed every argument, and I am lIery grateful to hirn for his help. This is not to say that he is to be held responsible for the imperfec tions that remain, and, in particular, I alone am responsible for all expressions of personal opinion and irreverent view point. P. R. H. Ann Arbor, Michigan ] anuary, 1963 Contents Section Page 1 1 Boolean rings ............................ . 2 Boolean algebras ......................... . 3 9 3 Fields of sets ............................ . 4 Regular open sets . . . . . . . . . . . . . . . . . . . 12 . . . . . . 5 Elementary relations. . . . . . . . . . . . . . . . . . 17 . . . . . 6 Order. . . . . . . . . . . . . . . . . . . . . . . . . . . 21 . . . . . . . . . 7 Infinite operations. . .. . . . . . . . . . . . . . . . . 25 . . . . . 8 Subalgebras . . . . . . . . . . . . . . . . . . . . .. . . . 31 . . . . . . 9 Homomorphisms . . . . . . . . . . . . . . . . . . . . 35 . . . . . . . 10 Free algebras . . . . . . . . . . . . . . . . . . . . . . 40 . . . . . . . 11 Ideals and filters. . . . . . . . . . . . . . . . . . . . 47 . . . . . . 12 The homomorphism theorem. . . . . . . . . . . . .. . . 52 . . 13 Boolean a-algebras . . . . . . . . . . . . . . . . . . 55 . . . . . . 14 The countable chain condition . . . . . . . . . . . . 61 . . . 15 Measure algebras . . . . . . . . . . . . . . . . . . . 64 . . . . . . . 16 Atoms.. . . . .. . . . . .. .. . . . ... . . . . .. . . ... . . .. 69 17 Boolean spaces . . . . . . . . . . . . . . . . . . . . 72 . . . . . . . 18 The representation theorem. . . . . . . . . . . . . . 77 . . . 19 Duali ty for ideals . . . . . . . . . . . . . . . . . .. . . 81 . . . . . 20 Duality for homomorphisms . . . . . . . . . . . . . . 84 . . . . 21 Completion . . . . . . . . . . . . . . . . . . . . . . . 90 . . . . . . . . 22 Boolean a-spaces . . . . . . . . . . . . . . . . . .. . . 97 . . . . . 23 The representation of a-algebras . . . . . . . . .. . . 100 . 24 Boolean measure spaces . . . . . . . . . . . . . .. . . 104 . . . 25 Incomplete algebras . . . . . . . . . . . . . . . .. . . 109 . . . . . 26 Products of algebras . . . . . . . . . . . . . . . .. . . 115 . . . . 27 Sums of algebras . . . . . . . . . . . . . . . . . .. . . 119 . . . . . 28 Isomorphisms of factors . . . . . . . . . . . . . .. . . 122 . . ."

This book grew out of lectures. It is intended as an introduction to classical two-valued predicate logic. The restriction to classical logic is not meant to imply that this logic is intrinsically better than other, non-classical logics; however, classical logic is a good introduction to logic because of its simplicity, and a good basis for applications because it is the foundation of classical mathematics, and thus of the exact sciences which are based on it. The book is meant primarily for mathematics students who are already acquainted with some of the fundamental concepts of mathematics, such as that of a group. It should help the reader to see for himself the advantages of a formalisation. The step from the everyday language to a formalised language, which usually creates difficulties, is dis cussed and practised thoroughly. The analysis of the way in which basic mathematical structures are approached in mathematics leads in a natural way to the semantic notion of consequence. One of the substantial achievements of modern logic has been to show that the notion of consequence can be replaced by a provably equivalent notion of derivability which is defined by means of a calculus. Today we know of many calculi which have this property."

This text deals with three basic techniques for constructing models of Zermelo-Fraenkel set theory: relative constructibility, Cohen's forcing, and Scott-Solovay's method of Boolean valued models. Our main concern will be the development of a unified theory that encompasses these techniques in one comprehensive framework. Consequently we will focus on certain funda mental and intrinsic relations between these methods of model construction. Extensive applications will not be treated here. This text is a continuation of our book, "I ntroduction to Axiomatic Set Theory," Springer-Verlag, 1971; indeed the two texts were originally planned as a single volume. The content of this volume is essentially that of a course taught by the first author at the University of Illinois in the spring of 1969. From the first author's lectures, a first draft was prepared by Klaus Gloede with the assistance of Donald Pelletier and the second author. This draft was then rcvised by the first author assisted by Hisao Tanaka. The introductory material was prepared by the second author who was also responsible for the general style of exposition throughout the text. We have inc1uded in the introductory material al1 the results from Boolean algebra and topology that we need. When notation from our first volume is introduced, it is accompanied with a deflnition, usually in a footnote. Consequently a reader who is familiar with elementary set theory will find this text quite self-contained.

Students become mathematical adventurers in these challenging and engaging activities designed to deepen and extend their understanding of concepts from the Common Core State Standards in Mathematics. The investigations in this book stretch students' mathematical imaginations to their limits as they solve puzzles, create stories, and explore fraction-related concepts that take them from the mathematics of ancient Greece to the outer reaches of infinity. Each activity comes with detailed support for classroom implementation including learning goals, discussion guides, detailed solutions, and suggestions for extending the investigation. There is also a free supplemental e-book offering strategies for motivation, assessment, parent communication, and suggestions for using the materials in different learning environments. Grades 5-8

This book develops the subject of matrices with special reference to differential equations and classical mechanics. It is intended to bring to the student of applied mathematics, with no previous knowledge of matrices, an appreciation of their conciseness, power and convenience in computation. Worked numerical examples, many of which are taken from aerodynamics, are included.

This text is the fifth and final in the series of educational books written by Israel Gelfand with his colleagues for high school students. These books cover the basics of mathematics in a clear and simple format - the style Gelfand was known for internationally. Gelfand prepared these materials so as to be suitable for independent studies, thus allowing students to learn and practice the material at their own pace without a class. Geometry takes a different approach to presenting basic geometry for high-school students and others new to the subject. Rather than following the traditional axiomatic method that emphasizes formulae and logical deduction, it focuses on geometric constructions. Illustrations and problems are abundant throughout, and readers are encouraged to draw figures and "move" them in the plane, allowing them to develop and enhance their geometrical vision, imagination, and creativity. Chapters are structured so that only certain operations and the instruments to perform these operations are available for drawing objects and figures on the plane. This structure corresponds to presenting, sequentially, projective, affine, symplectic, and Euclidean geometries, all the while ensuring students have the necessary tools to follow along. Geometry is suitable for a large audience, which includes not only high school geometry students, but also teachers and anyone else interested in improving their geometrical vision and intuition, skills useful in many professions. Similarly, experienced mathematicians can appreciate the book's unique way of presenting plane geometry in a simple form while adhering to its depth and rigor. "Gelfand was a great mathematician and also a great teacher. The book provides an atypical view of geometry. Gelfand gets to the intuitive core of geometry, to the phenomena of shapes and how they move in the plane, leading us to a better understanding of what coordinate geometry and axiomatic geometry seek to describe." - Mark Saul, PhD, Executive Director, Julia Robinson Mathematics Festival "The subject matter is presented as intuitive, interesting and fun. No previous knowledge of the subject is required. Starting from the simplest concepts and by inculcating in the reader the use of visualization skills, [and] after reading the explanations and working through the examples, you will be able to confidently tackle the interesting problems posed. I highly recommend the book to any person interested in this fascinating branch of mathematics." - Ricardo Gorrin, a student of the Extended Gelfand Correspondence Program in Mathematics (EGCPM)

Desktop Grid Computing presents common techniques used in numerous models, algorithms, and tools developed during the last decade to implement desktop grid computing. These techniques enable the solution of many important sub-problems for middleware design, including scheduling, data management, security, load balancing, result certification, and fault tolerance.

The book s first part covers the initial ideas and basic concepts of desktop grid computing. The second part explores challenging current and future problems. Each chapter presents the sub-problems, discusses theoretical and practical issues, offers details about implementation and experiments, and includes references to further reading and notes.

One of the first books to give a thorough and up-to-date presentation of this topic, this resource describes various approaches and models as well as recent trends that underline the evolution of desktop grids. It balances the theory of designing desktop grid middleware and architecture with applications and real-world deployment on large-scale platforms.

Reflecting many of the recent advances and trends in this area, Discrete Structures with Contemporary Applications covers the core topics in discrete structures as well as an assortment of novel applications-oriented topics. The applications described include simulations, genetic algorithms, network flows, probabilistic primality tests, public key cryptography, and coding theory. A modern and comprehensive introduction to discrete structures With clear definitions and theorems and carefully explained proofs, this classroom-tested text presents an accessible yet rigorous treatment of the material. Numerous worked-out examples illustrate key points while figures and tables help students grasp the more subtle and difficult concepts. "Exercises for the Reader" are interspersed throughout the text, with complete solutions included in an appendix. In addition to these, each section ends with extensive, carefully crafted exercise sets ranging from routine to nontrivial; answers can be found in another appendix. Most sections also contain computer exercises that guide students through the process of writing their own programs on any computing platform. Accommodates various levels of computer implementation Although the book highly encourages the use of computing platforms, it can be used without computers. The author explains algorithms in ordinary English and, when appropriate, in a natural and easy-to-understand pseudo code that can be readily translated into any computer language. A supporting website provides an extensive set of sample programs.

Through the infamous divorce of her parents, Ada Lovelace became the most talked-about child in Georgian Britain. This riveting biography tells the extraordinary yet little known story of her life and times-when mathematics was as fashionable as knitting among women and Ada became the world's first computer programmer. But for her era's view on gender, Ada would single-handedly have started the digital age more than two centuries ago.

This book is the first book-length treatment of hybrid logic and its proof-theory. Hybrid logic is an extension of ordinary modal logic which allows explicit reference to individual points in a model. The extra expressive power is useful for many applications, for example, when reasoning about time one often wants to formulate a series of statements about what happens at specific times. There is little consensus about proof-theory for ordinary modal logic. Many modal-logical proof systems lack important properties and the relationships between proof systems for different modal logics are often unclear. The present book demonstrates that hybrid-logical proof-theory remedies this lack of uniformity in ordinary modal-logical proof systems. It considers a spectrum of different versions of hybrid logic (propositional, first-order, international first-order, and intuitionist) and of different types of proof-systems for hybrid-logic (natural deduction, Gentzen, tableaux, and axiom systems). All these systems can be motivated independently, but the fact that the systems can be given in a uniform way shows that hybrid logic and hybrid-logical proof theory is a natural enterprise.

Prime numbers are beautiful, mysterious, and beguiling mathematical objects. The mathematician Bernhard Riemann made a celebrated conjecture about primes in 1859, the so-called Riemann hypothesis, which remains one of the most important unsolved problems in mathematics. Through the deep insights of the authors, this book introduces primes and explains the Riemann hypothesis. Students with a minimal mathematical background and scholars alike will enjoy this comprehensive discussion of primes. The first part of the book will inspire the curiosity of a general reader with an accessible explanation of the key ideas. The exposition of these ideas is generously illuminated by computational graphics that exhibit the key concepts and phenomena in enticing detail. Readers with more mathematical experience will then go deeper into the structure of primes and see how the Riemann hypothesis relates to Fourier analysis using the vocabulary of spectra. Readers with a strong mathematical background will be able to connect these ideas to historical formulations of the Riemann hypothesis.