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.21. Perfect Induction 

This video formalises the work done by the previous videos in the playlist. In particular it shows how a truth table can 'prove' that one Boolean expression does indeed equal another Boolean expression. This process of using truth tables in the way described in the video is called perfect induction.
<< Previous Video
Next Video >>
Please consider donating to help with the costs incurred in developing this website.             Donate >>