By J. Eldon Whitesitt

This advent to Boolean algebra explores the topic on a degree available even to these with a modest historical past in arithmetic. the 1st bankruptcy provides the algebra of units from an intuitive perspective, by way of a proper presentation in bankruptcy of Boolean algebra as an summary algebraic approach, without connection with applications. 
Succeeding chapters supply concise debts of functions to symbolic good judgment, targeting issues of common sense universal to basic arithmetic and discussing thoughts of legitimate argument and oblique proofs. extra themes comprise the algebra of circuits — switching, relay, and machine — in addition to the appliance of the algebra of units to likelihood thought. difficulties seem in the course of the textual content, with solutions to chose difficulties on the finish of the book.  aimed toward scholars of arithmetic, machine technology, and electric engineering, this article should be liked by way of an individual who is familiar with college-level arithmetic. it's going to turn out quite worthwhile to philosophy scholars and others wishing to check symbolic good judgment and its functions to desktop science. 

Show description

Read or Download Boolean Algebra and Its Applications PDF

Best algebra books

Structure and Representation of Jordan Algebras

###############################################################################################################################################################################################################################################################

Extra info for Boolean Algebra and Its Applications

Example text

Prove that for any a, b, and c in a Boolean algebra, the following four expressions are equal: (a) (a + b) (a' + c) (b + c) (b) ac + - a'b + be (c) (a + b) (a'+ c) (d) ac + a'b. 7. Show that the set {a, b, c, d) with operations (+) and defined below, is a Boolean algebra. + a b c d a a b c d a b b b b b c c d b c b b d a b c d a a a a a b b d b c a c c d d c a a d a d 8. Prove that in a Boolean algebra every triple of elements a, b, c satisfies the identity ab + be + ca = (a + b) (b + c) (c + a).

To show that the set of propositions and the operations of conjunction, disjunction, and negation form a Boolean algebra, it is necessary first to define the concept of equality. Two propositional functions g and h, each functions of the n propositional variables pl, p2i ... , pn, are said to be equal if and only if they have the same truth value for every possible way of assigning truth values to each of the n variables. For example, if g and h are each functions of the two variables p and q, we can determine whether they are equal by checking the truth values of g and h separately for each of the four possibilities: p false and q true; p true and q false; p and q both true; and p and q both false.

How many lost all four members? ") 7. At a party for 100 children, a large basket of candy is suspended from the ceiling. Each piece of candy is wrapped in either red, white, or blue paper. At the end of the party, the basket is broken and the children scramble for the candy. The children are then asked about the types of candy they have, with the following results: 40 have a red one, 60 have a blue one, 70 have a white one, 20 have a red one and a blue one, 25 have a red one and a white one, and 30 have a blue one and a white one.

Download PDF sample

Rated 4.81 of 5 – based on 46 votes