Home  - Math_Discover - Boolean Algebra
e99.com Bookstore
 Images Newsgroups
 1-20 of 91    1  | 2  | 3  | 4  | 5  | Next 20

Boolean Algebra:     more books (100)
1. Boolean Algebra and Its Applications by J. Eldon Whitesitt, 2010-03-18
2. Ones and Zeros: Understanding Boolean Algebra, Digital Circuits, and the Logic of Sets (IEEE Press Understanding Science & Technology Series) by John R. Gregg, 1998-03-16
3. Boolean Reasoning: The Logic of Boolean Equations by Frank Markham Brown, 2003-04-21
4. Introduction to Boolean Algebras by Steven Givant, 2009-11-23
5. Practice Problems in Number: Systems, Logic and Boolean Algebra by Edward Burstein, 1977-07
6. Boolean Algebra by R. L. Goodstein, 2007-01-15
7. Boolean Algebra for Computer Logic by Harold E. Ennes, 1978-08
8. ABC's of Boolean algebra, by Allan Herbert Lytel, 1972
9. Boolean Algebra; a Self-Instructional Programed Manual by federal electric corporation, 1966
10. Handbook of Boolean Algebras, Volume Volume 2 by Jeffrey M. Lemm, 1989-03-15
11. Boolean Algebra with Computer Applications by Gerald E. Williams, 1970-02-27
12. Schaum's Outline of Boolean Algebra and Switching Circuits by Elliott Mendelson, 1970-06-01
13. Boolean Algebra Essentials by Alan D. Solomon, 1990-05-16
14. Modern Computer Algebra by Joachim von zur Gathen, Jürgen Gerhard, 1999-01-01

lists with details

1. Logic Gates And Boolean Algebra
Logic Gates and boolean algebra. Created by Mark Mamo and Shane Bauman. The followingis a set of resources for a unit on Logic Gates and boolean algebra.
http://educ.queensu.ca/~compsci/units/BoolLogic/titlepage.html

Extractions: Logic Gates and Boolean Algebra Created by Mark Mamo and Shane Bauman The following is a set of resources for a unit on Logic Gates and Boolean Algebra. Introduction to Boolean Logic an outline of an activity to get students thinking about situations using Boolean logic. This activity also serves as an introduction to the AND and OR logic gates. Black Box Circuits an interesting hands-on activity that investigates different gate combinations as well as introduces NAND, NOR. XOR and XNOR Summary of Logic Gates a convenient hand-out summarizing the basic logic gates, their Boolean algebra notation and their truth tables Sample Questions on Logic Gates, Circuits and Truth Tables a handout for students to complete to reinforce the ideas of logic gates, circuits, truth tables and the relationships between them Discovering the Rules of Boolean Algebra a series of worksheets to help students discover the rules of Boolean algebra for themselves Simplifying Boolean Expressions a worksheet which helps students to discover the value of simplifying Boolean expressions and the role it plays in designing circuits

2. Boolean Algebra
boolean algebra. boolean algebra is defined as the study of the manipulation of symbols representing operations
http://www.programcpp.com/chapter04/4_1_4.html

3. Boolean Algebra - Wikipedia
http://www.wikipedia.org/wiki/Boolean_algebra

4. Boolean Algebra
We will find the following boolean algebra useful. Consider two logic variables A and B and the result of some Boolean
http://www.thoralf.uwaterloo.ca/htdocs/scav/boolean/boolean.html

Extractions: then we have the equations of Boolean algebra . Before 1900 Boolean algebra really meant the juggling of equations (and neg-equations) to reflect valid arguments. In 1904 E.V. Huntington wrote a paper [1] in which he viewed Boolean algebras as algebraic structures satisfying the equations obtained from the calculus of classes. This viewpoint became dominant in the 1920's under the influence of M.H. Stone and A. Tarski. Stone was initially interested in Boolean algebras in order to gain insight into the structure of rings of functions which were being investigated in functional analysis. He wrote two massive papers, one on the equivalence of Boolean algebras and Boolean rings, and the other on the duality between Boolean algebras and Boolean spaces [= totally disconnected compact Hausdorff spaces]. Tarski studied Boolean algebras while working on the abstract notion of `closure under deductive consequence'. In the 1930's Stone proved that every Boolean algebra is isomorphic to a field of sets, and that the equations true of the two-element Boolean algebra are the same as the equations true of all Boolean algebras; and these equations were consequences of a small initial set of defining equations. What has the modern subject of Boolean algebra got to do with propositional logic? Not very much. Boolean algebra became a deep and fascinating subject in its own right, with much more to offer than a convenient notation to analyze simple chains of reasoning. Nonetheless on the level of equivalence and equations the subjects of propositional logic, calculus of classes, and Boolean algebras are essentially the same, as illustrated by the following table:

5. Elements Of Boolean Algebra
The most obvious way to simplify Boolean expressions is to manipulate them in the same way as normal algebraic expressions are manipulated.
http://www.ee.surrey.ac.uk/Projects/Labview/boolalgebra

Extractions: Introduction Laws of Boolean Algebra Commutative Law Associative Law ... On-line Quiz The most obvious way to simplify Boolean expressions is to manipulate them in the same way as normal algebraic expressions are manipulated. With regards to logic relations in digital forms, a set of rules for symbolic manipulation is needed in order to solve for the unknowns. A set of rules formulated by the English mathematician George Boole describe certain propositions whose outcome would be either true or false . With regard to digital logic, these rules are used to describe circuits whose state can be either, 1 (true) or (false) . In order to fully understand this, the relation between the AND gate OR gate and NOT gate operations should be appreciated. A number of rules can be derived from these relations as Table 1 demonstrates. P1: X = or X = 1

6. What's So Logical About Boolean Algebra?
boolean algebra, a simple explanation
http://www.kerryr.net/pioneers/boolean.htm

Extractions: What's So Logical About Boolean Algebra? George Boole believed in what he called the process of analysis, that is, the process by which combinations of interpretable symbols are obtained. It is the use of these symbols according to well-determined methods of combination that he believed presented true calculus. Today, all our computers employ Boole's logic system - using microchips that contain thousands of tiny electronic switches arranged into logical gates that produce predictable and reliable conclusions. The basic logic gates comprise of AND OR and NOT . It is these gates, used in differing combinations, that allow the computer to execute its operations using binary language Each gate assesses various information (consisting of high or low voltages) in accordance with predetermined rules, and produces a single high or low voltage logical conclusion. The voltage itself represents the binary yes-no, true-false, one-zero concept. AND gates will only yield a TRUE result (that is, a binary 1) if all input is TRUE. Therefore, the top two gates will produce a FALSE (binary 0) result. OR gates are less fussy. An

7. Boolean Algebra -- From MathWorld
A mathematical structure which is similar to a Boolean ring, but which is defined using the meet and join operators instead of the usual addition and multiplication operators. Explicitly, a boolean algebra is the partial order on subsets defined by inclusion (Skiena 1990, p. 207), i.e., the
http://www.astro.virginia.edu/~eww6n/math/BooleanAlgebra.html

Extractions: A mathematical structure which is similar to a Boolean ring , but which is defined using the meet and join operators instead of the usual addition and multiplication operators. Explicitly, a Boolean algebra is the partial order on subsets defined by inclusion (Skiena 1990, p. 207), i.e., the Boolean algebra b A ) of a set A is the set of subsets of A that can be obtained by means of a finite number of the set operations union OR intersection AND ), and complementation NOT ) (Comtet 1974, p. 185). A Boolean algebra also forms a lattice (Skiena 1990, p. 170), and each of the elements of b A ) is called a Boolean function . There are Boolean functions in a Boolean algebra of order n (Comtet 1974, p. 186). In 1938, Shannon proved that a two-valued Boolean algebra (whose members are most commonly denoted and 1, or false and true) can describe the operation of two-valued electrical switching circuits. In modern times, Boolean algebra and Boolean functions are therefore indispensable in the design of computer chips and integrated circuits. Boolean algebras have a recursive structure apparent in the Hasse diagrams illustrated above for Boolean algebras of orders n = 2, 3, 4, and 5. These figures illustrate the partition between left and right halves of the lattice, each of which is the Boolean algebra on

8. Discovering The Basic Rules Of Boolean Algebra
Discovering the Basic Rules of boolean algebra. These two rules that youhave discovered are known as the associative laws of boolean algebra.
http://educ.queensu.ca/~compsci/units/BoolLogic/assocdistrib.html

Extractions: Consider the Boolean expression A + B + C. Does it matter which OR you evaluate first? Verify your answer using truth tables and then express your discovery using Boolean algebra notation. Now consider the Boolean expression A B C. Does it matter which AND is evaluated first? Once again verify your answer using truth tables and then express your discovery using Boolean algebra notation. These two rules that you have discovered are known as the associative laws of Boolean algebra. Example 1 To get into a physics program in university, Samantha needs to have OAC physics and either OAC algebra or OAC calculus. Assign Boolean variables to the conditions and write a Boolean expression for the program requirements. We will get you started: Let P represent whether or not Samantha has OAC physics. Another way of stating the conditions for the physics program is that Samantha needs OAC physics and OAC algebra, or OAC physics and OAC calculus. Using the same Boolean variables as above, write a Boolean expression for the program requirements. Since both of these expressions refer to the same situation the Boolean expressions must be equal. Verify this statement by comparing the truth tables for the expressions.

9. The Mathematics Of Boolean Algebra
Survey of the algebra of twovalued logic; by J. Donald Monk.Category Society Philosophy Stanford Encyclopedia of PhilosophyThe Mathematics of boolean algebra. On the other hand, the theory ofa boolean algebra with a distinguished subalgebra is undecidable.
http://plato.stanford.edu/entries/boolalg-math/

Extractions: JUL A Boolean algebra (BA) is a set A together with binary operations + and and a unary operation , and elements 0, 1 of A such that the following laws hold: commutative and associative laws for addition and multiplication, distributive laws both for multiplication over addition and for addition over multiplication, and the following special laws: x + (x y) = x x (-x) = These laws are better understood in terms of the basic example of a BA, consisting of a collection A of subsets of a set X closed under the operations of union, intersection, complementation with respect to X , with members and X . One can easily derive many elementary laws from these axioms, keeping in mind this example for motivation. Any BA has a natural partial order defined upon it by saying that x y if and only if x y y . This corresponds in our main example to . Of special importance is the two-element BA, formed by taking the set

10. Boolean Algebra
boolean algebra. The following table contains just a few rules that holdin a boolean algebra, written in both set and logic notation.
http://www.math.csusb.edu/notes/sets/boole/boole.html

Extractions: Previous: Return to notes A Boolean algebra is a set with two binary operations, and , that are commutative, associative and each distributes over the other, plus a unary operation . Also required are identity elements and U for the binary operations that satisfy and for all elements A in the set. One interpretation of Boolean algebra is the collection of subsets of a fixed set X . We take and U to be set union, set intersection, complementation, the empty set and the set X respectively. Equality here means the usual equality of sets. Another interpretation is the calculus of propositions in symbolic logic. Here we take and U to be disjunction, conjunction, negation, a fixed contradiction and a fixed tautology respectively. In this setting equality means logical equivalence. It is not surprising then that we find analogous properties and rules appearing in these two areas. For example, the axiom of the distributive properties says that for sets we have while is a familiar equivalence in logic. From the axioms above one can prove DeMorgan's Laws (in some axiom sets this is included as an axiom). The following table contains just a few rules that hold in a Boolean algebra, written in both set and logic notation. Rows 3 and 4 are DeMorgan's Laws. Note that the two versions of these rules are identical in structure, differing only in the choice of symbols.

11. Boolean Algebra - Wikipedia
boolean algebra. (Redirected from Boolean logic). A boolean algebra is alattice (A, ? , ?) with the following four additional properties
http://www.wikipedia.org/wiki/Boolean_logic

12. Boolean Algebra
boolean algebra. One Algebra. The rules of boolean algebra are simple andstraightforward, and can be applied to any logical expression.
http://www.play-hookey.com/digital/boolean_algebra.html

Extractions: Home www.play-hookey.com Tue, 03-18-2003 Digital Logic Families Digital Experiments Analog ... Test HTML Direct Links to Other Digital Pages: Combinational Logic: Basic Gates Derived Gates The XOR Function Binary Addition ... Boolean Algebra Sequential Logic: RS NAND Latch RS NOR Latch Clocked RS Latch RS Flip-Flop ... Converting Flip-Flop Inputs Alternate Flip-Flop Circuits: D Flip-Flop Using NOR Latches CMOS Flip-Flop Construction Counters: Basic 4-Bit Counter Synchronous Binary Counter Synchronous Decimal Counter Frequency Dividers ... The Johnson Counter Registers: Shift Register (S to P) Shift Register (P to S) The 555 Timer: 555 Internals and Basic Operation 555 Application: Pulse Sequencer Boolean Algebra One of the primary requirements when dealing with digital circuits is to find ways to make them as simple as possible. This constantly requires that complex logical expressions be reduced to simpler expressions that nevertheless produce the same results under all possible conditions. The simpler expression can then be implemented with a smaller, simpler circuit, which in turn saves the price of the unnecessary gates, reduces the number of gates needed, and reduces the power and the amount of space required by those gates. One tool to reduce logical expressions is the mathematics of logical expressions, introduced by George Boole in 1854 and known today as

13. Chapter 4 Boolean Algebra
Chapter 4. boolean algebra. 41 Describing Logic Circuits Algebraically
http://www.eelab.su.oz.au/digital_tutorial/chapter4/4_0.html

Extractions: Chapter 4 Boolean Algebra 4-1 Describing Logic Circuits Algebraically 4-2 Evaluating Logic Circuit Outputs 4-3 Implementing Circuits from Boolean Expression 4-4 Boolean Theorems 4-5 DeMorgan's Theorems 4-6 Universality of NAND and NOR Gates 4-7 Alternate Logic-Gate Representations 4-8 Logic Symbol Interpretation Let's Go to QUIZ 4

14. Boolean Algebra
boolean algebra, Symbolic Logic . Switching Theory and Logic Circuits
http://www.eg.bucknell.edu/~cs320/1995-fall/Boolean-Algebra.html

Extractions: Bucknell University I. Introduction The term algebra is commonly used in connection with the real numbers. The number system has two operations + and *, which are extended to relations between variables to build up algebraic expressions such as x y x x x , etc. Here x and y vary over the set of numbers. The essence of algebra is that the symbols do not have to stand for numbers. The structure of symbolic logic, switching circuits, probability theory and set theory is captured by Boolean Algebra. The first two of these are crucial for computers. How does a computer work? How does a computer add numbers? A computer is made of a bunch of electronic paraphernalia. The theory of how these gadgets are to be hooked up is contained in Boolean Algebra. The goal of this handout is to construct a circuit which will add positive whole numbers. II. Symbolic Logic

15. Boolean Algebra -- From MathWorld
boolean algebra, A boolean algebra also forms a lattice (Skiena 1990, p.170), and each of the elements of b(A) is called a Boolean function.
http://mathworld.wolfram.com/BooleanAlgebra.html

Extractions: A mathematical structure which is similar to a Boolean ring , but which is defined using the meet and join operators instead of the usual addition and multiplication operators. Explicitly, a Boolean algebra is the partial order on subsets defined by inclusion (Skiena 1990, p. 207), i.e., the Boolean algebra b A ) of a set A is the set of subsets of A that can be obtained by means of a finite number of the set operations union OR intersection AND ), and complementation NOT ) (Comtet 1974, p. 185). A Boolean algebra also forms a lattice (Skiena 1990, p. 170), and each of the elements of b A ) is called a Boolean function . There are Boolean functions in a Boolean algebra of order n (Comtet 1974, p. 186). In 1938, Shannon proved that a two-valued Boolean algebra (whose members are most commonly denoted and 1, or false and true) can describe the operation of two-valued electrical switching circuits. In modern times, Boolean algebra and Boolean functions are therefore indispensable in the design of computer chips and integrated circuits. Boolean algebras have a recursive structure apparent in the Hasse diagrams illustrated above for Boolean algebras of orders n = 2, 3, 4, and 5. These figures illustrate the partition between left and right halves of the lattice, each of which is the Boolean algebra on

16. Web Scripting And Logic, Or Boolean Algebra Evolt.org, Code
Web Scripting and Logic, or boolean algebra. Print Article, boolean algebra, orlogic, can be boiled down to the simplicity of memorized tables as well.
http://www.evolt.org/article/Web_Scripting_and_Logic_or_Boolean_Algebra/17/49918

17. Web Scripting And Logic, Or Boolean Algebra Evolt.org, Code
Web Scripting and Logic, or boolean algebra. boolean algebra, or logic,can be boiled down to the simplicity of memorized tables as well.
http://www.evolt.org/article/Web_Scripting_and_Logic_or_Boolean_Algebra/17/49918

18. BOOLEAN ALGEBRA QUIZ
boolean algebra Quiz. Give the relationship that represents the dual ofthe Boolean property A + 1 = 1? (Note * = AND, + = OR and ' = NOT)
http://www.ee.surrey.ac.uk/Projects/Labview/boolalgebra/quiz/

19. Boolean Algebra From FOLDOC
boolean algebra. mathematics Strangely, a boolean algebra (in the mathematicalsense) is not strictly an algebra, but is in fact a lattice. A
http://wombat.doc.ic.ac.uk/foldoc/foldoc.cgi?Boolean algebra

20. Boolean Algebra
boolean algebra. boolean algebra digital computers.). There are four arithmeticoperators in boolean algebra NOT, AND, OR, and EXCLUSIVE OR.
http://www.eskimo.com/~scs/cclass/mathintro/sx4.html

Extractions: Boolean algebra is a system of algebra (named after the mathematician who studied it, George Boole) based on only two numbers, and 1, commonly thought of as ``false'' and ``true.'' Binary numbers and Boolean algebra are natural to use with modern digital computers, which deal with switches and electrical currents which are either on or off. (In fact, binary numbers and Boolean algebra aren't just natural to use with modern digital computers, they are the fundamental basis of modern digital computers.) There are four arithmetic operators in Boolean algebra: NOT, AND, OR, and EXCLUSIVE OR. NOT takes one operand (that is, applies to a single value) and negates it: NOT is 1, and NOT 1 is 0. AND takes two operands, and yields a true value if both of its operands are true: 1 AND 1 is 1, but AND 1 is 0, and AND is 0. OR takes two operands, and yields a true value if either of its operands (or both) are true: OR is 0, but OR 1 is 1, and 1 OR 1 is 1. EXCLUSIVE OR, or XOR, takes two operands, and yields a true value if one of its operands, but not both, is true: XOR is 0, XOR 1 is 1, and 1 XOR 1 is 0.

 1-20 of 91    1  | 2  | 3  | 4  | 5  | Next 20