Geometry.Net - the online learning center
Home  - Math_Discover - Boolean Algebra
e99.com Bookstore
  
Images 
Newsgroups
Page 1     1-20 of 105    1  | 2  | 3  | 4  | 5  | 6  | 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

1. The Mathematics Of Boolean Algebra
Survey of the algebra of twovalued logic; by J. Donald Monk.
http://plato.stanford.edu/entries/boolalg-math/
version history
HOW TO CITE

THIS ENTRY
Stanford Encyclopedia of Philosophy
A ... Z
This document uses XHTML/Unicode to format the display. If you think special symbols are not displaying correctly, see our guide Displaying Special Characters last substantive content change
JUL
The Encyclopedia Now Needs Your Support

Please Read How You Can Help Keep the Encyclopedia Free
The Mathematics of Boolean Algebra
1. Definition and simple properties
A Boolean algebra (BA) is a set A 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:
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

2. Boolean Algebra
boolean algebra. A boolean algebra is a set with two binary operations, and , that are commutative, associative and each distributes over the
http://tmsyn.wc.ask.com/r?t=an&s=hb&uid=24312681243126812&sid=343126

3. Boolean Algebra - Wikipedia, The Free Encyclopedia
Specifically, boolean algebra was an attempt to use algebraic techniques to deal The operators of boolean algebra may be represented in various ways.
http://en.wikipedia.org/wiki/Boolean_algebra
Boolean algebra
From Wikipedia, the free encyclopedia.
For the use of binary numbers in computer systems, please see the article binary arithmetic
In mathematics , a Boolean algebra , or Boolean lattice , is an algebraic structure whose elements have properties abstracted from those of truth values , and the operations on which "capture the essence" of the logical operations AND OR and NOT as well as the corresponding set-theoretic operations intersection union and complement Boolean algebras are named after George Boole , an English mathematician at University College Cork
Contents
edit
Formal definition
A Boolean algebra is a set A , supplied with two binary operations (logical AND), (logical OR), a unary operation / ~ (logical NOT) and two elements (logical FALSE) and 1 (logical TRUE), such that, for all elements a b and c of set A , the following axioms hold:
associativity commutativity absorption distributivity complements
The first three pairs of axioms above: associativity, comutativity and absorption, mean that ( A ) is a lattice . Thus a Boolean algebra can also be equivalently defined as a distributive complemented lattice From these axioms , one can show that the smallest element 0, the largest element 1, and the complement ¬ a of any element a are uniquely determined. For all

4. A Brief History Of Algebra And Computing: An Eclectic Oxonian View
By Oxford professor, Jonathan Bowen. Discusses origins in ancient Greece, Arabia and England, analytical machines, boolean algebra, and recent developments in the field.
http://vmoc.museophile.org/algebra/

Table of Contents

Next: The Origins of Algebra
Up: The Virtual Museum of Computing
A Brief History of Algebra and Computing
An Eclectic Oxonian View
Jonathan P. Bowen
Ex Oxford University Computing Laboratory
Wolfson Building, Parks Road, Oxford UK Dedicated to Prof. C.A.R. Hoare , F RS James Martin Professor of Computing
at the Oxford University Computing Laboratory
Text originally completed on his 60th birthday, 11th January 1994
If you are faced by a difficulty or a controversy in science, an ounce of algebra is worth a ton of verbal argument. J.B.S. Haldane That excellent woman knew no more about Homer than she did about Algebra, but she was quite contented with Pen's arrangements ... and felt perfectly confident that her dear boy would get the place which he merited. Pendennis (1848-50), by William Makepeace Thackeray
(The story of the progress of an Oxford student.) O h h eck- a nother h our o f a lgebra!
Table of Contents
Printed version published in IMA Bulletin , pages 6-9, January/February 1995. See also longer version in

5. 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
http://tmsyn.wc.ask.com/r?t=an&s=hb&uid=24312681243126812&sid=343126

6. Monadic Boolean Algebra - Wikipedia, The Free Encyclopedia
In abstract algebra, a monadic boolean algebra is an algebraic structure of the is a boolean algebra and ? is a unary operator, called the existential
http://en.wikipedia.org/wiki/Monadic_Boolean_algebra
Monadic Boolean algebra
From Wikipedia, the free encyclopedia.
In abstract algebra , a monadic Boolean algebra is an algebraic structure of the signature
A
where
A
is a Boolean algebra and ∃ is a unary operator , called the existential quantifier , satisfying the identities:
  • x x x y x y x y x y
  • x is called the existential closure of x . Monadic Boolean algebras play the same role for the monadic logic of quantification that Boolean algebras play for ordinary propositional logic The dual of the existential quantifier is the universal quantifier ∀ defined by ∀ x x principle of duality , the universal quantifier satisfies the identities:
  • x x xy x y x y x y
  • x is called the universal closure of x . The universal quantifier is recoverable from the existential quantifier via the identity ∃ x x algebraic structures A A Boolean algebra and ∀ satisfies the properties of a universal quantifier listed above. Retrieved from " http://en.wikipedia.org/wiki/Monadic_Boolean_algebra Categories Abstract algebra Mathematical logic ... Boolean algebra Views Personal tools Navigation Search Toolbox

    7. George Boole Invents Boolean Algebra
    1847 AD to 1854 AD George Boole Invents boolean algebra
    http://tmsyn.wc.ask.com/r?t=an&s=hb&uid=24312681243126812&sid=343126

    8. 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/
    Volume I - DC Volume II - AC Volume III - Semiconductors Volume IV - Digital ... Converting truth tables into Boolean expressions Search All Volumes Volume I - DC Volume II - AC Volume III - Semiconductors Volume IV - Digital Volume V - Reference Volume VI - Experiments
    Check out our new Electronics Forums
    Ask questions and help answer others. Check it out!

    Chapter 7: BOOLEAN ALGEBRA
    All About Circuits
    Volume IV - Digital Chapter 7: BOOLEAN ALGEBRA
    All About Electric Circuits
    ... Contact

    9. Design, Analysis & Circuit Theory
    Basic DC analysis, analogue coupling circuits, antenna theory, boolean algebra, BJT configurations, basic DC theory BJT bias, basic AC theory, BJT bias analysis. An extensive array of information.
    http://www.mitedu.freeserve.co.uk/adt.htm
    Please note,only underlined articles are complete.
    Analysis
    Basic DC Analysis

    Boolean Algebra Examples
    Frequency Response

    Colpitts Oscillator

    BJT Bias Analysis
    Transmitter Distance

    Small-Signal Analysis
    James Baxandall Passive Tone Control Network
    by Ramon Vargas (external link)
    Design Analogue Coupling Circuits BJT Configurations FET Configurations BJT Bias Circuits Negative Feedback in amplifiers by Lazar pancic Transistor as a Switch Op-amp Tutorial by Tony Van Roon (external link) Over Voltage Protection Removing "DC thump" from Audio Circuits Switch Contact De-Bouncing 555 Timer Tutorial by Tony Van Roon (external link) Unregulated Power Supply Design Wien Bridge Oscillator Design by Ramon Vargas Q Multiplication in the Wien Bridge Oscillator by Ramon Vargas Theory Antenna Theory and Transmitting Basic DC Theory Basic AC Theory Diode Charge Pump AM-FM Demodulators by Ramon Vargas Heat Sinks for Transistors (external link to Kelsey Park School) Ohms Law for AC Circuits Measuring Input Output Impedance Low Noise Design Techniques Transistor Modelling Radio Calculations by Harry Lythall (external link) Thevevin and Norton Networks Tuned Circuits

    10. Logic Gates And Boolean Algebra
    Logic Gates and boolean algebra Created by Mark Mamo and Shane Bauman
    http://tmsyn.wc.ask.com/r?t=an&s=hb&uid=24312681243126812&sid=343126

    11. Boolean Algebraic Identities - Chapter 7: BOOLEAN ALGEBRA - Volume IV - Digital
    boolean algebraic identities. In mathematics, an identity is a statement true for Like ordinary algebra, boolean algebra has its own unique identities
    http://www.allaboutcircuits.com/vol_4/chpt_7/3.html
    Volume I - DC Volume II - AC Volume III - Semiconductors Volume IV - Digital ... Back to Chapter Index Search All Volumes Volume I - DC Volume II - AC Volume III - Semiconductors Volume IV - Digital Volume V - Reference Volume VI - Experiments
    Check out our new Electronics Forums
    Ask questions and help answer others. Check it out!

    Boolean algebraic identities
    All About Circuits
    Volume IV - Digital Chapter 7: BOOLEAN ALGEBRA Boolean algebraic identities
    Boolean algebraic identities
    In mathematics, an identity is a statement true for all possible values of its variable or variables. The algebraic identity of x + = x tells us that anything (x) added to zero equals the original "anything," no matter what value that "anything" (x) may be. Like ordinary algebra, Boolean algebra has its own unique identities based on the bivalent states of Boolean variables. The first Boolean identity is that the sum of anything and zero is the same as the original "anything." This identity is no different from its real-number algebraic equivalent: No matter what the value of A, the output will always be the same: when A=1, the output will also be 1; when A=0, the output will also be 0.

    12. Mgehrke.html
    New Mexico State University Nonstandard mathematics, operators on boolean algebras, fuzzy mathematics, universal algebra, general topology, posets and lattices.
    http://www.math.nmsu.edu/mgehrke/mgehrke.html
    Mai Gehrke
    Department of Mathematical Sciences Phone: (505] 646-4218 New Mexico State University Fax: (505) 646-1064 Las Cruces NM mailto:%20mgehrke@nmsu.edu Office Location: Science Hall Room 232 Return to Faculty Page Return to Main Index
    PROFESSIONAL EXPERIENCE
    Visiting Professor, Technical University of Denmark Lyngby Denmark /044/05 Visiting Lektor University of Copenhagen Copenhagen Denmark Visitor, University of Oxford Oxford United Kingdom Professor, New Mexico State University Las Cruces New Mexico
    Part-time consulting, Physical Science Laboratory, Las Cruces New Mexico
    1/975/97 Visiting Professor, Vanderbilt University Nashville Tennessee
    8/9612/96 Visiting Lektor University of Copenhagen Copenhagen Denmark
    8/93 5/00 Associate Professor, New Mexico State University Las Cruces New Mexico
    8/905/93 Assistant Professor, New Mexico State University Las Cruces New Mexico
    8/885/90 2-year position as Assistant Professor, Vanderbilt University Nashville Tennessee
    Assistante Associée Université de Nice, Nice France
    Assistante Associée Université de Haute Alsace Mulhouse France
    Teaching Assistant

    13. LEARN BOOLEAN ALGEBRA
    INITIATION TO boolean algebra boolean algebra is the algebra of logic.
    http://tmsyn.wc.ask.com/r?t=an&s=hb&uid=24312681243126812&sid=343126

    14. Chapter 4 Boolean Algebra
    Chapter 4. boolean algebra 43 Implementing Circuits from Boolean Expression 4-4 Boolean Theorems 4-5 DeMorgan s Theorems
    http://www.eelab.usyd.edu.au/digital_tutorial/chapter4/4_0.html
    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

    15. Web Page Experiment
    Research group in set theoretic topology and boolean algebra. Members, research interests.
    http://www.math.ku.edu/~roitman/seminar.html
    Research group in set theoretic topology and Boolean algebra
    Permanent faculty members Bill Fleissner, Jack Porter, Judy Roitman Post-dctoral faculty member : Tetsuya Ishiu Advanced graduate students: Nate Carlson, Jila Niknejad, Lynn Yengulalp Seminar : nearly every Monday and Wednesday
    306 Snow Hall For pictures from the Spring 2001 AMS Special Session in Set Theory, Topology, and Boolean Algebra, held at KU, click here
    Faculty research interests
    William Fleissner started his research in set theory, in particular, consistency results in general topology. After focusing on the normal Moore space conjecture and related topics, he became interested in many areas of set theoretic topology. Recently, he has studied "projective properties" for example, the questions, "If all continuous Tychonoff images of space are realcompact, must the space be Lindelof?" and "What can be said about spaces all of whose regular images are normal?" Two topics of current research are D-spaces and subspaces of the product of finitely many ordinals.
    Jack Porter 's research is focused on spaces in which a given space is dense (extensions), and on the related notion of

    16. The Mathematics Of Boolean Algebra
    The Mathematics of boolean algebra
    http://tmsyn.wc.ask.com/r?t=an&s=hb&uid=24312681243126812&sid=343126

    17. Elements Of Boolean Algebra
    Laws of boolean algebra Laws of boolean algebra. Commutative Law; Associative Law; Distributive Law; Identity Law; Redundance Law; De Morgan s Theorem
    http://www.ee.surrey.ac.uk/Projects/Labview/boolalgebra/
    Boolean Algebra
    Introduction Laws of Boolean Algebra
    • Commutative Law
    • Associative Law ... On-line Quiz
      Introduction
      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
      Table 1: Boolean Postulates
      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 . These are obtained by changing every AND(.) to OR(+), every OR(+) to AND(.) and all 1's to 0's and vice-versa.

    18. -= Karnaugh Minimizer =- Karnaugh Maps Minimization Software
    boolean algebra assistant program is an interactive program easy to use for the freshmen electrical engineering student. Shows output in either SOP(DNF) or POS(CNF) format.
    http://karnaugh.shuriksoft.com/
    Home About Download FAQ ... Screen shots Welcome
    Are you a programmer
    Learn how Karnaugh Minimizer can help you with refactoring of your
    existing source code
    Karnaugh Minimizer is a tool for developers of small digital devices and radio amateurs, also for those who is familiar with Boolean algebra, mostly for electrical engineering students.
    • Draws 2 - 8 variable Karnaugh Maps Quine Mc Cluskey minimization tool allow you
      to handle 9-23 variables. Convert boolean formula to VHDL or Verilog code; Expression-to-map tracking - Allows you to click
      on a term in a given expression and see it highlighted on the map; Simplifies boolean expressions that you enter. Multi lingual user interface. And many more useful
    Major update 2.0 is Free to try!
    kmin.zip

    And only to buy Home About Download FAQ ... Screen shots
    Please email your comments on this site to webmaster@shuriksoft.com

    19. 89.07.07 Boolean Algebra And Its Application To Problem Solving And
    boolean algebra and its Application to Problem Solving and Logic Circuits by Hermine Smikle.
    http://tmsyn.wc.ask.com/r?t=an&s=hb&uid=24312681243126812&sid=343126

    20. Boolean Algebra -- From MathWorld
    A boolean algebra is a mathematical structure that is similar to a Boolean ring Explicitly, a boolean algebra is the partial order on subsets defined by
    http://mathworld.wolfram.com/BooleanAlgebra.html
    INDEX Algebra Applied Mathematics Calculus and Analysis Discrete Mathematics ... Alphabetical Index
    DESTINATIONS About MathWorld About the Author Headline News ... Random Entry
    CONTACT Contribute an Entry Send a Message to the Team
    MATHWORLD - IN PRINT Order book from Amazon Algebra Named Algebras Boolean Algebras Boolean Algebra A Boolean algebra is a mathematical structure that is similar to a Boolean ring , but that 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 of a set is the set of subsets of 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 is called a Boolean function . There are Boolean functions in a Boolean algebra of order (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

    Page 1     1-20 of 105    1  | 2  | 3  | 4  | 5  | 6  | Next 20

    free hit counter