Home  - Math_Discover - Boolean Algebra

Books Baby Camera Phones Computers Games DVD Electronics Kitchen Magazines Music Garden Software Tools Toys Video Apparel & Accessories Jewelry & Watches Musical Instruments Health & Personal Care Beauty Sports & Outdoors Office Products

e99.com Bookstore

Images

Newsgroups

21-40 of 105    Back | 1  | 2  | 3  | 4  | 5  | 6  | Next 20

Boolean Algebra:     more books (100)

Mathematical Logic: A Course with Exercises Part I: Propositional Calculus, Boolean Algebras, Predicate Calculus, Completeness Theorems (Pt.1) by Rene Cori, Daniel Lascar, 2000-11-09 Logic and Boolean Algebra by Kathleen Levitz, 1979-02 BOOLEAN ALGEBRA AND ITS APPLICATION INCLUDING BOOLEAN MATRIX ALGEBRA by H. Graham Flegg, 1964 Applied Boolean Algebra an Elementar 2ND Edition by Franz Hohn, 1966 Applied Boolean Algebra by Franz E. Hohn, 1967-01 Set Theory: Boolean-Valued Models and Independence Proofs (Oxford Logic Guides) by John L. Bell, 2005-07-28 Decision Points: Boolean Logic for Computer Users and Beginning Online Searchers by Janaye M Houghton, Robert S Houghton, 1999-02-15 Introduction to the Comparative Method With Boolean Algebra (Quantitative Applications in the Social Sciences) Cardinal Invariants on Boolean Algebras (Modern Birkhäuser Classics) by J. Donald Monk, 2009-11-23 Binary Arithmetic and Boolean Algebra by Angelo Christopher Gillie, 1965-09 Introduction to Boolean Algebra and Logic Design: A Program for Self Instruction by Gerhard E. Hoernes, M. Heilweil, 1964-06 Nearly Projective Boolean Algebras (Lecture Notes in Mathematics) by Lutz Heindorf, Leonid B. Shapiro, 1994-12-27 Cardinal Functions on Boolean Algebras: LECTURES IN MATHEMATICs ETH Zürich (Lectures in Mathematics. ETH Zürich) by MONK, 1999-11-12 Boolean Constructions in Universal Algebras (Mathematics and Its Applications) by A.G. Pinus, 2010-11-02

lists with details

21. Redirect... To New Location
    boolean algebra assistant program is an interactive program extremely easy to use. A musthave tool for the freshmen electrical engineering student. Shows output in either SOP(DNF) or POS(CNF) format. Win 98/ME/NT/2000/XP  
    http://www.etel.dn.ua/~shurik/karnaugh/

22. Math Whiz Fights Terror With Smarts - MIT News Office
    Lattice theory, which includes boolean algebra, is Farley's favorite conceptual realm, and his talent at it has earned him great acclaim.  
    http://tmsyn.wc.ask.com/r?t=an&s=hb&uid=24312681243126812&sid=343126

23. Boolean Algebra
    A boolean algebra is a set with two binary operations, One interpretation of boolean algebra is the collection of subsets of a fixed set X. We take  
    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.

24. George Boole (1815 - 1864)
    Brief biography and description of boolean algebra.  
    http://www.home.gil.com.au/~bredshaw/boole.htm
    
    Extractions: T he original `working class boy made good', Boole was born in the wrong time, in the wrong place, and definitely in the wrong class - he didn't have a hope of growing up to be a mathematical genius, but he did it anyway. Born in the English industrial town of Lincoln, Boole was lucky enough to have a father who passed along his own love of math. Young George took to learning like a politician to a pay-rise and, by the age of eight, had outgrown his father's self-taught limits. A family friend stepped in to teach the boy basic Latin, and was exhausted within a few years. Boole was translating Latin poetry by the age of twelve. By the time he hit puberty, the adolescent George was fluent in German, Italian and French as well. At 16 he became an assistant teacher, at 20 he opened his own school. Over the next few years, depending mainly on mathematical journals borrowed from the local Mechanic's Institute, Boole struggled with Isaac Newton's Principia and the works of 18th and 19th century French mathematicians Pierre-Simon Laplace and Joseph-Louis Lagrange. He had soon mastered the most intricate mathematical principles of his day. It was time to move on.

25. Chapter 4 Boolean Algebra
    Chapter 4 boolean algebra 41 Describing Logic Circuits Algebraically 4-2 Evaluating Logic Circuit Outputs  
    http://tmsyn.wc.ask.com/r?t=an&s=hb&uid=24312681243126812&sid=343126

26. Boolean Algebra
    boolean algebra is the theoretical foundation for digital systems. boolean algebra formalizes the rules of logic. On the surface computers are great number  
    http://134.193.15.25/vu/course/cs281/lectures/boolean-algebra/boolean-algebra.ht
    
    Extractions: Boolean Algebra You may have been intimidated by the mathematical word problems on the SAT or ACT. On first reading they seem almost impossible to solve. "Larry and Fred share a bookcase. Larry has twice as many books as Fred. There are 75 books on the bookcase. How many books does Fred have?" Then you realize how the problem can be redefined as an algebra problem. As an algebra problem the solution is much easier. 2*F + F = 75 F = 25 Fred has 25 books. For many of the same reasons digital systems are based on an algebranot the regular algebra you and I are familiar with but rather Boolean algebra. Boolean algebra is the theoretical foundation for digital systems. Boolean algebra formalizes the rules of logic. On the surface computers are great number crunchers, but inside computations are performed by binary digital circuits following the rules of logic. We use Boolean algebra in this class to simplify Boolean expressions which represent circuits. In this lecture we will study algebraic techniques for simplifying expressions. In the next lecture we will look at mechanical waysalgorithms you can use with pencil and paper to simplify moderately complex Boolean functions and algorithms that machines can follow to simplify arbitrarily complex Boolean functions. Axioms In 1854 George Boole Introduced the following formalism that eventually became Boolean Algebra.

27. Volume IV - Digital :: Chapter 7: BOOLEAN ALGEBRA
    An introduction to boolean algebra from the perspective of electronic engineering.  
    http://www.allaboutcircuits.com/vol_4/chpt_7/index.html

28. Elements Of Boolean Algebra
    Laws of boolean algebra. Table 2 shows the basic Boolean laws. Note that every law has two expressions, (a) and (b). This is known as duality.  
    http://tmsyn.wc.ask.com/r?t=an&s=hb&uid=24312681243126812&sid=343126

29. What's So Logical About Boolean Algebra?
    boolean algebra, a simple explanation. What s So Logical About boolean algebra? George Boole believed in what he called the ‘process of analysis’,  
    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

30. Logic Gates And Boolean Algebra
    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.  
    http://educ.queensu.ca/~compsci/resources/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

31. Boolean Algebra
    introduced by George Boole in 1854 and known today as boolean algebra. The rules of boolean algebra are simple and straightforward, and can be applied  
    http://www.play-hookey.com/digital/boolean_algebra.html
    
    Extractions: Home www.play-hookey.com Thu, 09-01-2005 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

32. Digital Logic
    There is a group of useful theorems of boolean algebra which help in developing the boolean algebra Theorems. The applications of digital logic involve  
    http://hyperphysics.phy-astr.gsu.edu/hbase/electronic/diglog.html
    
    Extractions: Digital Logic For two binary variables (taking values and 1) there are 16 possible functions . The functions involve only three operations which make up Boolean algebra: AND, OR, and COMPLEMENT. They are symbolically represented as follows: These operations are like ordinary algebraic operations in that they are commutative associative , and distributive . There is a group of useful theorems of Boolean algebra which help in developing the logic for a given operation. Digital Logic Theorems Digital Logic Functions Index Electronics concepts ... Electricity and magnetism R Nave Go Back Boolean Algebra Theorems The applications of digital logic involve functions of the AND, OR, and NOT operations. These operations are subject to the following identities: These theorems can be used in the algebraic simplification of logic circuits which come from a straightforward application of a truth table DeMorgan's Theorem Basic Gates Index ... Electricity and magnetism R Nave Go Back Binary Functions of Two Variables Digital logic involves combinations of the three types of operations for two variables: AND, OR, and NOT. There are sixteen possible functions: This is an active graphic. Click on any of the functions for further details.

33. Abstract Algebra:Boolean Algebra - Wikibooks
    boolean algebra Wikibooksboolean algebra was created by Charles Boole in {DATE}. It had few applications at the time, boolean algebra, like regular algebra, has certain rules.  
    http://en.wikibooks.org/wiki/Abstract_algebra:Boolean_algebra

34. Boolean Algebra
    boolean algebra. The binary 0 and 1 states are naturally related to the true and false logic variables. We will find the following boolean algebra useful.  
    http://www.phys.ualberta.ca/~gingrich/phys395/notes/node121.html
    
    Extractions: Next: Logic Gates Up: Digital Circuits Previous: Number Representation The binary and 1 states are naturally related to the true and false logic variables. We will find the following Boolean algebra useful. Consider two logic variables A and B and the result of some Boolean logic operation Q . We can define Q is true if and only if A is true AND B is true. Q is true if A is true OR B is true. Q is true if A is false. A useful way of displaying the results of a Boolean operation is with a truth table. We will make extensive use of truth tables later. If no ``-'' is available on your text processor or circuit drawing program an `` N '' can be used, ie. We list a few trivial Boolean rules in table

35. Boolean Algebra And Logic Circuits
    This page contains Verilog tutorial, Verilog Syntax, Verilog Quick Reference, PLI, modelling memory and FSM, Writing Testbenches in Verilog, Lot of Verilog  
    http://www.asic-world.com/digital/boolean.html

36. Boolean Algebra And Logic Circuits Part-I
    This page contains Verilog tutorial, Verilog Syntax, Verilog Quick Reference, PLI, modelling memory and FSM, Writing Testbenches in Verilog, Lot of Verilog  
    http://www.asic-world.com/digital/boolean1.html
    
    Extractions: Boolean Algebra and Logic Circuits Part-I Sep-3-2005 Symbolic Logic Boolean algebra derives its name from the mathematician George Boole. Symbolic Logic uses values, variables and operations : Variables are represented by letters and can have one of two values, either or 1. Operations are functions of one or more variables. These basic operations can be combined to give expressions. Example : Precedence As with any other branch of mathematics, these operators have an order of precedence. NOT operations have the highest precedence, followed by AND operations, followed by OR operations. Brackets can be used as with other forms of algebra. e.g. X.Y + Z and X.(Y + Z) are not the same function. Function Definitions The logic operations given previously are defined as follows : Define f(X,Y) to be some function of the variables X and Y.

37. Robbins Algebras Are Boolean
    It is clear that every boolean algebra is a Robbins algebra, so the interesting problem was whether every Robbins algebra is Boolean.  
    http://www.mcs.anl.gov/~mccune/papers/robbins/
    
    Extractions: Argonne National Laboratory Posted on the Web October 15, 1996. Last updated September 24, 2003. These Web pages contain some information on the solution of the Robbins problem. A paper on this topic appears in the Journal of Automated Reasoning [W. McCune, "Solution of the Robbins Problem", JAR 19(3), 263276 (1997)]. Here is a preprint . The JAR paper has simpler proofs than the ones below on this page. Here are the input files and proofs corresponding to the JAR paper A draft of a press release , intended for a wider audience, is also available. The Robbins problem-are all Robbins algebras Boolean?-has been solved: Every Robbins algebra is Boolean. This theorem was proved automatically by EQP , a theorem proving program developed at Argonne National Laboratory. In 1933, E. V. Huntington presented [1,2] the following basis for Boolean algebra: x + y = y + x. [commutativity] (x + y) + z = x + (y + z). [associativity] n(n(x) + y) + n(n(x) + n(y)) = x. [Huntington equation] Shortly thereafter, Herbert Robbins conjectured that the Huntington equation can be replaced with a simpler one [5]:

38. Boolean Algebra
    TOPIC 4.1.4 boolean algebra. boolean algebra is defined as the study of the manipulation of symbols representing operations according to the rules of logic.  
    http://www.programcpp.com/chapter04/4_1_4.html

39. George Boole Invents Boolean Algebra
    Around the time that Charles Babbage was inventing the first mechanical computer, a British mathematician called George Boole, was busily inventing a new  
    http://www.maxmon.com/1847ad.htm
    
    Extractions: George Boole Invents Boolean Algebra Around the same time that Charles Babbage was struggling with his Analytical Engine , one of his contemporaries, a British mathematician called George Boole, was busily inventing a new and rather cunning form of mathematics. Boole made significant contributions in several areas of mathematics, but was immortalized for two works in 1847 and 1854, in which he represented logical expressions in a mathematical form now known as Boolean Algebra . Boole's work was all the more impressive because, with the exception of elementary school and a short time in a commercial school, he was almost completely self-educated. a In conjunction with Boole, another British mathematician, Augustus DeMorgan, formalized a set of logical operations now known as DeMorgan transformations. As the Encyclopedia Britannica says: "A renascence of logical studies came about almost entirely because of Boole and DeMorgan." a In fact the rules we now attribute to DeMorgan were known in a more primitive form by William of Ockham (also known as William of Occam) in the 14th Century. In order to celebrate Ockham's position in history, the OCCAM computer programming language was named in his honor. (In fact, OCCAM is the native programming language for the British- developed INMOS transputer.)

40. Boolean Algebra: Definition And Much More From Answers.com
    boolean algebra n. An algebra in which elements have one of two values and the algebraic operations defined on the set are logical OR, a type of.  
    http://www.answers.com/topic/boolean-algebra
    
    Extractions: Encyclopedia Boolean algebra bū lēən ) , an abstract mathematical system primarily used in computer science and in expressing the relationships between sets (groups of objects or concepts). The notational system was developed by the English mathematician George Boole c.1850 to permit an algebraic manipulation of logical statements. Such manipulation can demonstrate whether or not a statement is true and show how a complicated statement can be rephrased in a simpler, more convenient form without changing its meaning. In his 1881 treatise, Symbolic Logic

21-40 of 105    Back | 1  | 2  | 3  | 4  | 5  | 6  | Next 20