Skip to main content

1990 | Buch

Boolean Reasoning

The Logic of Boolean Equations

verfasst von: Frank Markham Brown

Verlag: Springer US

insite
SUCHEN

Über dieses Buch

This book is about the logic of Boolean equations. Such equations were central in the "algebra of logic" created in 1847 by Boole [12, 13] and devel­ oped by others, notably Schroder [178], in the remainder of the nineteenth century. Boolean equations are also the language by which digital circuits are described today. Logicians in the twentieth century have abandoned Boole's equation­ based logic in favor of the more powerful predicate calculus. As a result, digital engineers-and others who use Boole's language routinely-remain largely unaware of its utility as a medium for reasoning. The aim of this book, accordingly, is to is to present a systematic outline of the logic of Boolean equations, in the hope that Boole's methods may prove useful in solving present-day problems. Two Logical Languages Logic seeks to reduce reasoning to calculation. Two main languages have been developed to achieve that object: Boole's "algebra of logic" and the predicate calculus. Boole's approach was to represent classes (e. g. , happy creatures, things productive of pleasure) by symbols and to represent logical statements as equations to be solved. His formulation proved inadequate, however, to represent ordinary discourse. A number of nineteenth-century logicians, including Jevons [94], Poretsky [159], Schroder [178], Venn [210], and Whitehead [212, 213], sought an improved formulation based on ex­ tensions or modifications of Boole's algebra. These efforts met with only limited success.

Inhaltsverzeichnis

Frontmatter
Chapter 1. Fundamental Concepts
Abstract
This chapter surveys basic mathematical ideas and language needed in the remainder of the book. The material in this chapter is provided for readers having little experience with the concepts and terminology of modern algebra; other readers may wish to proceed directly to the next chapter. The discussion is informal and only those topics directly applicable to Boolean reasoning are considered. The reader unacquainted with set-theory is cautioned that the sets discussed in this chapter are restricted to be finite,i.e., to comprise only a finite number of elements. A text such as that by Halmos [77] should be consulted to gain a balanced understanding of the theory of sets.
Frank Markham Brown
Chapter 2. Boolean Algebras
Abstract
We outline in this chapter the ideas concerning Boolean algebras that we shall need in the remaining chapters. For a formal and complete treatment, see Halmos [78], Mendelson [137], Rudeanu [172], or Sikorski [187]. For an informal approach and a discussion of applications, see Arnold [3], Car-vallo [35], Hohn [86], Kuntzmann [110], Svoboda & White [193], or Whitesitt [214]. Rudeanu’s text [172] is unique as a complete and modern treatment of Boolean functions and the solution of Boolean equations.
Frank Markham Brown
Chapter 3. The Blake Canonical Form
Abstract
Boole’s object in inventing an “algebra of logic” [12, 13] was to reduce the processes of reasoning to those of calculation. He showed that a system of logical equations, unlike a system of ordinary equations, can be reduced to a single equivalent equation (we consider the reduction-process in Chapter 4). He chose the standard reduced form f = 0, where f is a Boolean function. Reasoning is carried out in Boole’s formulation by solving that equation for certain of its arguments in terms of others.
Frank Markham Brown
Chapter 4. Boolean Analysis
Abstract
In this chapter we consider methods for analyzing systems of Boolean equations. These methods are of central importance in Boolean reasoning. We first consider ways in which systems of Boolean equations may be related. In particular, we define consequents, antecedents, equivalents, and solutions of Boolean systems. We also discuss several processes useful for Boolean reasoning. Among such processes are the reduction of a system of equations to a single equivalent equation, the elimination of a variable from an equation, the detection of redundant variables in an interval, and the substitution of an expression for a variable in a Boolean formula.
Frank Markham Brown
Chapter 5. Syllogistic Reasoning
Abstract
We outline in this chapter an approach, which we call “syllogistic,” to the solution of logical problems. The essential features of the syllogistic approach were formulated by Blake [10].
Frank Markham Brown
Chapter 6. Solution of Boolean Equations
Abstract
Many problems in the application of Boolean algebra may be reduced to that of solving a Boolean equation of the form
$$ f(X) = 0, $$
(6.1)
Frank Markham Brown
Chapter 7. Functional Deduction
Abstract
The central process of Boolean reasoning is the extraction of a derived system from a given Boolean system (cf. Section 4.2). The derived system may be categorized as
  • functional (of the form X = F(Y)) or general (i.e., not necessarily functional).
  • antecedent or consequent.
Frank Markham Brown
Chapter 8. Boolean Identification
Abstract
We have been concerned until now with techniques of Boolean reasoning. In this chapter and the next, we apply those techniques to the solution of particular kinds of problems. The problems are chosen to illustrate the techniques; no attempt is made to catalogue the problem-areas to which Boolean reasoning might usefully be applied. In the present chapter, we consider how a Boolean “black box” may be identified by means of an adaptive input-output experiment.
Frank Markham Brown
Chapter 9. Recursive Realizations of Combinational Circuits
Abstract
In this chapter we illustrate some applications of Boolean reasoning in the design of multiple-output switching circuits. The stimulus applied to the circuit shown in Figure 9.1 is an input-vector, X = (x1, x2,..., x m ) , of binary signals; its response is an output-vector, Z = (z1, z2,..., z n ), of binary signals. We assume the circuit to be combinational, by which we mean that the value of Z at any time is a function of the value of X at that time. A sequential circuit, on the other hand, is one for which the value of Z may depend on past values of X as well as on its present value.
Frank Markham Brown
Backmatter
Metadaten
Titel
Boolean Reasoning
verfasst von
Frank Markham Brown
Copyright-Jahr
1990
Verlag
Springer US
Electronic ISBN
978-1-4757-2078-5
Print ISBN
978-1-4757-2080-8
DOI
https://doi.org/10.1007/978-1-4757-2078-5