JohnPhilipJones
  • Home
  • 1-Minute Videos
    • A). Binary and Number Systems Revision
    • B). Logic Gate Revision
  • Edexcel
    • 1.2. Algorithms
    • 2.1 Binary
    • 3.1 Hardware
    • 3.2 Software
    • 6.2 Constructs
    • 6.5 Operators
    • 6.6. Subprograms
  • Video Index
    • 1. Basic Logic Gates
    • 2. Boolean Algebra
    • 3. Machine Code
    • 4. Number Systems
    • 5. Operating Systems
    • 6. Visual Basic
    • 7. GIMP Graphics
  • Donate
  • Python
  • Mathematics
  • Revision
  • Contact

2.5. Video A Boolean Redundancy Law F = A Or Not(A)

​"Or'ing" a variable with its "Not'ed" version always gives one. This video shows why this is the case. The understanding of this axiom is key to understanding many theorems covered later in the playlists.
<< Previous Video
Next Video >>
Please consider donating to help with the costs incurred in developing this website.             Donate >>