Search results

Jump to navigation Jump to search

Page title matches

  • ...' {{nowrap|(negation, ~)}} that reverses the truth value of any statement. Boolean algebra can be used to analyze computer chips and switching circuits, as well as lo Boolean algebra is not a portion of [[elementary algebra]] as taught in secondary schools,
    13 KB (1,959 words) - 19:49, 1 September 2020
  • 238 bytes (31 words) - 12:17, 14 July 2011
  • ...70414602 |year=1990 |publisher=McGraw-Hill}} An accessible introduction to Boolean algebra and its applications. ...r |year=2001}} A discussion of the wide field of sentential logic of which Boolean algebra is the tip of the iceberg.
    670 bytes (88 words) - 15:04, 21 July 2011
  • 907 bytes (145 words) - 14:06, 16 July 2011
  • ...te=2011-07-16}} An historical and introductory essay on the application of Boolean algebra to circuits.
    350 bytes (48 words) - 14:25, 16 July 2011

Page text matches

  • ...te=2011-07-16}} An historical and introductory essay on the application of Boolean algebra to circuits.
    350 bytes (48 words) - 14:25, 16 July 2011
  • ...70414602 |year=1990 |publisher=McGraw-Hill}} An accessible introduction to Boolean algebra and its applications. ...r |year=2001}} A discussion of the wide field of sentential logic of which Boolean algebra is the tip of the iceberg.
    670 bytes (88 words) - 15:04, 21 July 2011
  • ...(y \vee z) \wedge (z \vee x)</math> satisfies these axioms, so that every Boolean algebra is a median algebra.
    2 KB (316 words) - 13:38, 16 July 2011
  • {{r|Boolean algebra}}
    507 bytes (65 words) - 07:17, 22 July 2011
  • {{r|Boolean algebra}}
    477 bytes (65 words) - 07:22, 22 July 2011
  • {{r|Boolean algebra}}
    910 bytes (145 words) - 14:05, 16 July 2011
  • ...' {{nowrap|(negation, ~)}} that reverses the truth value of any statement. Boolean algebra can be used to analyze computer chips and switching circuits, as well as lo Boolean algebra is not a portion of [[elementary algebra]] as taught in secondary schools,
    13 KB (1,959 words) - 19:49, 1 September 2020
  • ...uries, with the design of logic gates in digital hardware. Shannon called boolean algebra "switching algebra" in the context of digital hardware design. **''This linked [[Boolean algebra]] to the design of digital circuits (and called it "Switching Algebra")''
    7 KB (993 words) - 15:28, 8 January 2023
  • ...le, against one cipher he might treat the text as a vector of bits and use Boolean algebra while for another he might choose to treat it as a vector of bytes and use ...o it cannot readily be described with linear equations in either normal or boolean algebra. Another is to use [[Block cipher#S-boxes|S-boxes]], which are lookup table
    6 KB (882 words) - 05:49, 8 April 2024
  • |align=right|[[propositional logic]], [[Boolean algebra]] |align=right|[[propositional logic]], [[Boolean algebra]]
    9 KB (1,308 words) - 13:37, 16 July 2011
  • **''This linked [[Boolean algebra]] to the design of digital circuits (and called it "Switching Algebra")''
    3 KB (449 words) - 13:27, 4 January 2023
  • * [[George Boole|Boole, George]] (1815-1864) - inventor of [[Boolean algebra]] * [[Claude Shannon|Shannon, Claude]] (1916-2001) - association of boolean algebra with digital design; pioneering work in [[information theory]]
    4 KB (515 words) - 09:39, 10 November 2008
  • * [[Boolean algebra]]
    18 KB (2,669 words) - 08:38, 17 April 2024
  • ...set ''S'' with the related characteristic function is an embedding of the Boolean algebra <math>(\{0,1\}^S, \cup, \cap, -, \emptyset, S)</math> into the algebra <mat
    6 KB (993 words) - 08:55, 30 May 2009
  • ...[[variables]] that may have only one of these two values, operations of [[Boolean algebra]] are defined: '''and''', '''or''', '''not''' for these operations, the fol
    6 KB (916 words) - 15:07, 16 July 2011
  • ...le, against one cipher he might treat the text as a vector of bits and use Boolean algebra while for another he might choose to treat it as a vector of bytes and use ...oth, he has a problem. Of course arithmetic operations can be expressed in Boolean algebra or vice versa, but the expressions are inconveniently (for the cryptanalyst
    53 KB (8,371 words) - 05:48, 8 April 2024
  • ...er known in later years for founding the field of [[information theory]]. Boolean algebra subsequently became known as "switching algebra" by computer designers.
    26 KB (3,913 words) - 06:51, 7 April 2014
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)