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

101-105 of 105    Back | 1  | 2  | 3  | 4  | 5  | 6

Boolean Algebra:     more books (100)

The Structure of Double Boolean Algebras (Berichte Aus Der Mathematik) by Bjorn Vormbrock, 2006-03-07 Applied Boolean Algebra: an Elementary Introduction, Second Edition by Franz E. Hohn, 1966-01-01 Probability theory on boolean algebras of events by Octav Onicescu, 1976 Introduction to Boolean Algebra and Logic Design by Editors, 1967 PRINCIPLES AND APPLICATIONS OF BOOLEAN ALGEBRA FOR ELECTRONIC ENGINEERS by SALVATORE ANTHONY ADELFIO, 1965-01-01 Boolean Algebra by A.K. Sharma, 2007-01-01 Basic Digital Electronics: Understanding Number Systems, BooleanAlgebra and Logical Circuits by Ray Ryan, 1990-05 Applied Boolean Algebra. Elementary Introduction. 2nd Edition. Categories of Boolean Sheaves of Simple Algebras (Lecture Notes in Mathematics) by Yves Diers, 1986-05-09 The logic of switching circuits;: A first course in Boolean algebra, (An Exposition-university book) by George P Roullard, 1967 Boolean Algebra and Its Applications by WHITESITT (J. Eldon), 1961 Boolean Algebra by A. Sharma, 2008-04-15 Boolean Algebra: An entry from Macmillan Reference USA's <i>Macmillan Reference USA Science Library: Computer Sciences</i> by Ida M. Flynn, 2002 APPLIED BOOLEAN ALGEBRA AN ELEMENTARY INTRODUCTION

lists with details

101. Algebra, Boolean: New & Used Books Category Search Result For Algebra, Boolean
     algebra, boolean New Used Books Category Search Result for algebra, boolean. Compare new and used books prices among 122 book stores in a click.  
     http://www.fetchbook.info/fwd_topics/id_1546874.html

102. Robbins Algebras Are Boolean
     A web text by William McCune describing the solution of this problem by a theoremproving program, with input files and the proofs.  
     http://www-unix.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]:

103. Howstuffworks "How Boolean Logic Works"
     boolean logic lies at the heart of the digital revolution. Find out all about boolean gates and how by combining them you can create any digital component!  
     http://computer.howstuffworks.com/boolean.htm
     
     Extractions: Have you ever wondered how a computer can do something like balance a check book, or play chess , or spell-check a document? These are things that, just a few decades ago, only humans could do. Now computers do them with apparent ease. How can a "chip" made up of silicon and wires do something that seems like it requires human thought? If you want to understand the answer to this question down at the very core, the first thing you need to understand is something called Boolean logic . Boolean logic, originally developed by George Boole in the mid 1800s, allows quite a few unexpected things to be mapped into

104. Tutorial - Boolean Logic
     control and embedded systems programming with the C programming language.  
     http://www.learn-c.com/boolean.htm
     
     Extractions: ::. Control And Embedded Systems .:: Boolean Logic Home Order Let me know what you think Previous: Data lines, bits, nibbles, bytes, words, binary and HEX Next: Address Lines and Ports Control and embedded systems frequently deal with individual bits in order to control specific operations or to determine the condition of part of a system. For example, a bit might be turned on to light a lamp or activate a relay, or a bit might be off to indicate a switch is on (off meaning on is very common due to the nature of hardware order some and see what I mean Boolean logic , developed by George Boole (1815-1864), is often used to refine the determination of system status or to set or clear specific bits. Boolean logic is simply a way of comparing individual bits. It uses what are called operators to determine how the bits are compared. They simulate the gates that you will see in the hardware section you will read shortly. Think of operators as boxes with multiple inputs and one output. Feed in various combinations of bit values, and the output will be high or low depending on the type of operation. The examples show 2 inputs, although gates can have more. Also, gates are often combined to form more complex logic. A modern microprocessor contains huge numbers of them with many inputs and many varying combinations. Please note that the terms on high and will be considered the same logical state, and

105. Newman Library : Instruction : Help Guides : Boolean Searching
     boolean operators may be used in most databases, and are used to broaden or narrow a In the CUNY+ databases, as well as in most other databases, boolean  
     http://newman.baruch.cuny.edu/instruct/handouts/boolean.htm
     
     Extractions: BASIC BOOLEAN SEARCHING Boolean operators (or logical connectors) AND, OR, and NOT are used to link together keywords when creating a search statement. Boolean operators may be used in most databases, and are used to broaden or narrow a search. In the CUNY+ databases, as well as in most other databases, Boolean searching is available within the keyword search option ( for CUNY+ use k= ). Always read screens carefully (especially HELP screens) or ask for assistance at the reference desk. AND Keywords combined with AND will retrieve records only where both terms appear.

101-105 of 105    Back | 1  | 2  | 3  | 4  | 5  | 6