Preview

logic gates

Powerful Essays
Open Document
Open Document
2239 Words
Grammar
Grammar
Plagiarism
Plagiarism
Writing
Writing
Score
Score
logic gates
Boolean logic

Student
Ali Alsaad: 1007194
Date: 20/2/2014

Table of Contents
1-History and introduction
2-Types of Logic gates
3-Uses of logic gates
4-Electronic circuits
5-Conclusion

Introduction

The term Boolean logic (Also known as Boolean algebra) honors George Boole. a self-educated English mathematician. He introduced the algebraic system initially in a small pamphlet, The Mathematical Analysis of Logic, published in 1847 in response to an ongoing public controversy between Augustus De Morgan and William Hamilton, and later as a more substantial book, The Laws of Thought, published in 1854. Boole 's formulation differs from that described above in some important respects. For example, conjunction and disjunction in Boole was not a dual pair of operations. Boolean algebra emerged in the 1860s, in papers written by William Jevons and Charles Sanders Peirce. The first systematic presentation of Boolean algebra and distributive lattices is owed to the 1890 Vorlesungen of Ernst Schröder. The first extensive treatment of Boolean algebra in English is A. N. Whitehead 's 1898 Universal Algebra. Boolean algebra as an axiomatic algebraic structure in the modern axiomatic sense begins with a 1904 paper by Edward V. Huntington. Boolean algebra came of age as serious mathematics with the work of Marshall Stone in the 1930s, and with Garrett Birkhoff 's 1940 Lattice Theory. In the 1960s, Paul Cohen, Dana Scott, and others found deep new results in mathematical logic and axiomatic set theory using offshoots of Boolean algebra, namely forcing and Boolean-valued models.
Whereas in elementary algebra expressions denote mainly numbers, in Boolean algebra they denote the truth values false and true. These values are represented with the bits (or binary digits) being 0 and 1. They do not behave like the integers 0 and 1, for which 1 + 1 = 2, but may be identified with the elements of the two-element field, for which 1 + 1 = 0 with + serving as the



References: Bibliography http://electronics.howstuffworks.com/digital-electronics1.htm. (n.d.). http://en.wikipedia.org/wiki/Electronic_circuit. (n.d.). http://whatis.techtarget.com/definition/logic-gate-AND-OR-XOR-NOT-NAND-NOR-and-XNOR. (n.d.). http://www.electrical4u.com/some-common-applications-of-logic-gates/. (n.d.).

You May Also Find These Documents Helpful

  • Satisfactory Essays

    2.What number does a bit that is turned on represent? What number does a bit that is turned off represent? On is 1 and Off is 2…

    • 286 Words
    • 2 Pages
    Satisfactory Essays
  • Satisfactory Essays

    b. 1 represents a bit that is turned ON. 0 represents a bit that is turned OFF. (pg. 8)…

    • 388 Words
    • 2 Pages
    Satisfactory Essays
  • Satisfactory Essays

    unit 5 assignment 1

    • 423 Words
    • 3 Pages

    4. The AND operator connects two Boolean expressions into one compound expression. Both must be true for the compound expression to be true.…

    • 423 Words
    • 3 Pages
    Satisfactory Essays
  • Powerful Essays

    Nt1330 Unit 1 Research Paper

    • 4285 Words
    • 18 Pages

    A boolean can only be one of two values, either true or false. A boolean only really needs one bit (an eighth of a byte) to hold true (1) or false (0) but strangely, Visual Basic uses two bytes to hold a boolean variable.…

    • 4285 Words
    • 18 Pages
    Powerful Essays
  • Satisfactory Essays

    NT1210 Final Exam Review

    • 726 Words
    • 3 Pages

    Truth Table 0 AND 0 = False (0) / 1 AND 0 False (0) / 1 AND 1 True (1)…

    • 726 Words
    • 3 Pages
    Satisfactory Essays
  • Good Essays

    Unit 5 PT1420

    • 959 Words
    • 7 Pages

    The AND operator takes two Boolean expressions as operands and creates a compound Boolean expression that is True only when both sub-expressions are true.…

    • 959 Words
    • 7 Pages
    Good Essays
  • Satisfactory Essays

    ECT114 Week3 Homework

    • 1022 Words
    • 15 Pages

    Z is the output of a NAND gate. The Boolean operator for the NAND gate is , there should be an inversion bar over the entire expression, and the inputs are (A + B) and (C D). Refer to Chapter 3…

    • 1022 Words
    • 15 Pages
    Satisfactory Essays
  • Good Essays

    Boole did not study for an academic degree, but he started working at the age of 16 as an assistant school teacher with an interest in language. However, in 1835 he opened his own school and began to study mathematics on his own. He studied the works of Pierre-Simon Laplace and Joseph-Louis Lagrange, which later became the basis of his first mathematics paper. After receiving encouragement from Duncan Gregory, he began publishing in the Cambridge Mathematical…

    • 788 Words
    • 4 Pages
    Good Essays
  • Good Essays

    Computation and Reasoning

    • 1205 Words
    • 5 Pages

    Therefore consider the Actor -- Leading Role, Actress -- Leading Role, Best Picture and Directing in the years of 1973 and 1987.…

    • 1205 Words
    • 5 Pages
    Good Essays
  • Good Essays

    Simplifying Expressions

    • 530 Words
    • 2 Pages

    The number preceding the variables in a term is called the coefficient (Dugopolski, M. (2012). The commutative property allows movement of terms to different locations within expressions and the operation symbol in front of the term will move as well. The associative property is used to group like terms together so they can all be combined. Like terms must have the same variable raised to the same power, or with the same exponent.…

    • 530 Words
    • 2 Pages
    Good Essays
  • Good Essays

    Logic Model

    • 3027 Words
    • 13 Pages

    Scriven (1991) would argue that evaluation has been around for many years, and is only now recognised as a discipline. He would go further and say it is like a knowledge which has been around for a decade before we were discussing its use, nature and logic. It is essentially different from science in its methods and thought. He would argue it is only recently we have appreciated its value as a discipline we still have a long way to go.…

    • 3027 Words
    • 13 Pages
    Good Essays
  • Good Essays

    Circuits

    • 1002 Words
    • 5 Pages

    Much of today’s logic design is based on two major assumptions: all signals are binary, and time is discrete. Both of these assumptions are made in order to simplify logic design. By assuming binary values on signals, simple Boolean logic can be used to describe and manipulate logic constructs. By assuming time is discrete, hazards and feedback can largely be ignored. However, as with many simplifying assumptions, a system that can operate without these assumptions has the potential to generate better results.…

    • 1002 Words
    • 5 Pages
    Good Essays
  • Powerful Essays

    Symbolic Logic

    • 6053 Words
    • 25 Pages

    Logic is the theory of the way in which people reason, with the aim of studying the principles of valid reasoning. The study of logic is the effort to determine the conditions under which one is justified in passing from given statements, called premises, to a conclusion that is claimed to follow from them. Logical validity is a relationship between the premises and the conclusion such that if the premises are true then the conclusion is true.…

    • 6053 Words
    • 25 Pages
    Powerful Essays
  • Good Essays

    James Lectures at Harvard in 1967 and was later published in 1975 under the title Logic and…

    • 880 Words
    • 4 Pages
    Good Essays
  • Good Essays

    <br>In 1936 an American (Alonzo Church) and a Briton (Alan M. Turing) published independently (as is often the coincidence in science) the basics of a new branch in Mathematics (and logic): computability or recursive functions (later to be developed into Automata Theory).…

    • 1707 Words
    • 7 Pages
    Good Essays