Study guide

5.2 Boolean Algebra, De Morgan Theorems and Logic Simplification

EASA Part-66 Module 05 — Digital Techniques / Electronic Instrument Systems Exam

Track your progress as you read

Finished sections get a check mark.

1 Chapter 1: Numbering Systems

1.1 Numbering Systems: Decimal, Binary, Octal and Hexadecimal 1.2 Binary Arithmetic and Signed Number Representation 1.3 Binary Coded Decimal, Gray Code and Alphanumeric Codes

2 Chapter 2: Data Conversion

2.1 Analogue and Digital Signals, Sampling and Quantisation 2.2 Digital-to-Analogue Converters 2.3 Analogue-to-Digital Converters

3 Chapter 3: ARINC 429 Data Buses

3.1 ARINC 429 Specification, Physical Layer and Topology 3.2 ARINC 429 32-Bit Word Architecture 3.3 ARINC 429 Transmission, Timing and Troubleshooting

4 Chapter 4: Advanced Avionics Data Buses and Aircraft Ethernet

4.1 ARINC 629 Digital Autonomous Terminal Access 4.2 MIL-STD-1553B Military Avionics Data Bus 4.3 AFDX / ARINC 664 Part 7 Avionics Full-Duplex Switched Ethernet

5 Chapter 5: Combinational Logic Gates and Boolean Algebra

5.1 Basic Logic Gates, Truth Tables and Logic Levels 5.2 Boolean Algebra, De Morgan Theorems and Logic Simplification 5.3 Universal Gates and Aircraft Combinational Applications

6 Chapter 6: Sequential Logic, Registers and Logic Diagrams

6.1 Bistable Multivibrators: SR, JK, D and T Flip-Flops 6.2 Shift Registers and Data Storage Elements 6.3 Asynchronous and Synchronous Counters and Logic-Diagram Interpretation

7 Chapter 7: Computer Structure and Microprocessors

7.1 Computer Architecture, Terminology and the Bus System 7.2 Semiconductor Memory Technologies 7.3 Microprocessor Operation, Instruction Cycles and I/O

8 Chapter 8: Integrated Circuits, Multiplexing and Integrated Modular Avionics

8.1 Integrated Circuit Technology, Encoders, Decoders and Scale of Integration 8.2 Multiplexing and Demultiplexing Techniques 8.3 Remote Data Concentrators and Integrated Modular Avionics

9 Chapter 9: Fibre Optics in Aviation

9.1 Physics of Light Transmission and Optical Fibres 9.2 Fibre Cable Types, Signal Degradation and Optical Components 9.3 Fibre Optic Maintenance, Termination, Splicing and Inspection

10 Chapter 10: Electronic Displays and Flight Instrument Layout

10.1 Display Technologies: CRT, LED and LCD 10.2 Electronic Flight Instrument System Architecture 10.3 Cockpit Symbology, Colour Standards and Display Reversion

11 Chapter 11: Electrostatic Sensitive Devices

11.1 Physics of Electrostatic Charge and Device Susceptibility 11.2 ESDS Damage Mechanisms: Catastrophic versus Latent Failures 11.3 ESDS Handling, Storage, Packaging and Workshop Procedures

12 Chapter 12: Software Management Control and Airworthiness

12.1 Aviation Software Classification and RTCA DO-178C / EUROCAE ED-12C 12.2 Software Configuration Management and Part Numbering 12.3 Data Loading, Integrity Verification and Unapproved Changes

13 Chapter 13: Electromagnetic Environment

13.1 Electromagnetic Interference and Compatibility 13.2 High Intensity Radiated Fields and RF Hazards 13.3 Lightning Protection, Bonding and Static Dischargers

14 Chapter 14: Engine Indication, Warning and Monitoring Systems

14.1 Airbus ECAM — Electronic Centralised Aircraft Monitoring 14.2 Boeing EICAS — Engine Indicating and Crew Alerting System 14.3 Comparison, Failure Reversion and Sensor Interfacing

15 Chapter 15: Flight Management, Navigation and Surveillance Systems

15.1 Flight Management System and Control Display Unit 15.2 Inertial Reference, AHRS/ADIRU Context and GPS 15.3 Traffic Collision Avoidance and Terrain Awareness

16 Chapter 16: Fly-By-Wire, BITE, ACARS, Cabin and Information Systems

16.1 Fly-By-Wire Flight Control 16.2 Built-In Test Equipment and Central Maintenance Computers 16.3 ACARS, Cabin Systems and Information Systems

5.2 Boolean Algebra, De Morgan Theorems and Logic Simplification

Key Takeaways Explain This Topic AI

De Morgan’s theorems state that (A·B)′ = A′ + B′ and (A+B)′ = A′ · B′.

Inverting both inputs of an AND gate yields a NOR equivalent, because A′ · B′ equals (A+B)′.

Inverting both inputs of an OR gate yields a NAND equivalent, because A′ + B′ equals (A·B)′.

Absorption gives A + A·B = A, and a NAND gate is equivalent to an OR gate with both inputs inverted.

Two inversion bubbles on the same path cancel; bubble pushing swaps AND with OR and places or removes a bubble on every pin of that gate.

Last updated: September 2026

5.2 Boolean Algebra, De Morgan Theorems and Logic Simplification

The pre-12 June 2024 detailed description for 5.5(a) named equivalent circuits as well as symbols and tables; current Appendix I retains the broader “Identification and applications” wording. Boolean algebra is the language used to prove that two drawings implement the same combinational function. The output still depends only on present inputs; simplification never turns a gate network into a flip-flop or a counter. Those sequential devices belong in a later chapter.

The aim on the aircraft and in the examination is practical: fewer packages, the same truth table, and a schematic that can be read in either distinctive-shape or IEC form. ExamFinch presents these identities as independent study material for Module 5; they are standard Boolean results, not an official EASA partnership claim.

Core identities

Write 1 for HIGH and 0 for LOW in positive logic. Product is AND; sum is inclusive OR; a prime marks inversion. The identities below are used constantly when a wiring diagram is redrawn as a single gate.

  • Law OR form AND form
  • Identity A + 0 = A A · 1 = A
  • Null (annulment) A + 1 = 1 A · 0 = 0
  • Idempotent A + A = A A · A = A
  • Complement A + A′ = 1 A · A′ = 0
  • Double inversion (A′)′ = A (A′)′ = A
  • Commutative A + B = B + A A · B = B · A
  • Associative (A+B)+C = A+(B+C) (A·B)·C = A·(B·C)
  • Distributive A + (B·C) = (A+B)·(A+C) A · (B+C) = (A·B) + (A·C)
  • Absorption A + (A·B) = A A · (A+B) = A

Worked absorption. Y = A + A·B. Factor A: Y = A · (1 + B). Null law: 1 + B = 1, so Y = A · 1 = A. Electrically, if A is already 1, the extra AND term cannot change the OR. If A is 0, both terms are 0. Either way the output follows A, so the AND gate is redundant.

Worked distribution the other way. Y = (A+B)·(A+C). Expand: Y = A·A + A·C + B·A + B·C = A + A·C + A·B + B·C. Absorb A·C and A·B into A: Y = A + B·C. That identity is the dual of the ordinary distributive law and is a frequent examination rewrite: an AND of two OR terms with a shared literal collapses to that literal ORed with the product of the others.

Worked cancellation. Y = A·B + A·B′. Factor A: Y = A · (B + B′) = A · 1 = A. The two AND terms are complementary in B, so they reconstruct A. A candidate who treats Boolean + as arithmetic plus and writes 2A has left the algebra.

De Morgan’s theorems

Two statements, used in both directions:

  • The complement of a product is the sum of the complements: (A·B)′ = A′ + B′
  • The complement of a sum is the product of the complements: (A+B)′ = A′ · B′

In words that match the hangar drawings:

A NAND equals an OR with both inputs inverted .

A NOR equals an AND with both inputs inverted .

Inverting both inputs of AND yields NOR , because A′ · B′ = (A+B)′.

Inverting both inputs of OR yields NAND , because A′ + B′ = (A·B)′.

Two-input proof by exhaustive table

  • A B A·B (A·B)′ A′ B′ A′+B′ A+B (A+B)′ A′·B′
  • 0 0 0 1 1 1 1 0 1 1
  • 0 1 0 1 1 0 1 1 0 0
  • 1 0 0 1 0 1 1 1 0 0
  • 1 1 1 0 0 0 0 1 0 0

Columns (A·B)′ and A′+B′ are identical, so NAND = OR with inverted inputs. Columns (A+B)′ and A′·B′ are identical, so NOR = AND with inverted inputs. The same pattern extends to three or more inputs: invert the operator (AND ↔ OR) and invert every literal.

Why the AND-with-inverted-inputs drawing is NOR

An AND gate with bubbles already on both inputs computes A′ · B′. De Morgan says that product of complements is (A+B)′ — the NOR function. On an IEC rectangle that network is either & with a circle on each input , or ≥1 with a circle on the output . Both drawings have the same four-row table. Treating input bubbles as decoration, or assuming any bubble turns AND into NAND, is the classic trap: NAND is AND with the bubble on the output , not on the inputs.

Why the OR-with-inverted-inputs drawing is NAND

An OR gate with bubbles on both inputs computes A′ + B′ = (A·B)′. That is NAND. IEC may show ≥1 with input circles, or & with an output circle. Same table.

Bubble pushing

Bubble pushing is De Morgan applied to a drawing without rewriting the algebra by hand:

Pushing a bubble through a gate changes AND into OR or OR into AND , and adds or removes a bubble on every pin of that gate (all inputs and the output).

Two bubbles on the same net cancel (double inversion).

A bubble may be drawn on either end of a wire; it still inverts that signal once.

Example. Start with NAND: AND shape, bubble on the output. Push the output bubble through the gate: the AND becomes OR, the output bubble disappears, and a bubble appears on each input . The result is OR with both inputs inverted — the De Morgan equivalent already proved. Pushing again restores the original NAND.

Example with mixed polarity. A three-input AND feeding a lamp, with one active-low discrete, is drawn as AND with a single input bubble. That is not NOR. Only all inputs inverted would convert AND into NOR. One inverted input is a different function: Y = A′ · B · C, which is 1 only when A is LOW and B and C are HIGH.

Examination trap equivalents

  • Drawing seen on the schematic Same combinational function Not the same
  • AND shape, bubble on output NAND; OR with both inputs inverted AND; NOR
  • OR shape, bubble on output NOR; AND with both inputs inverted OR; NAND
  • AND shape, bubble on every input NOR NAND
  • OR shape, bubble on every input NAND NOR
  • IEC ≥1 with output circle NOR AND, XOR, a latch
  • IEC & with output circle NAND AND
  • IEC =1 XOR (1 when inputs differ) Inclusive OR
  • Two bubbles in series on one net The uninverted signal A stored bit

XOR is the usual confusion with OR because both are 1 for 01 and 10. They disagree on 11: OR is 1, XOR is 0. Substituting an OR symbol into a parity or comparator drawing changes the table.

Simplification must preserve the table. Replacing NAND with AND because the distinctive shapes look similar, or replacing ≥1 with & because both are rectangles, is a symbol error, not a Boolean reduction. Replacing a combinational equivalent with a clocked latch because a bubble looks like a storage marker is a category error: inversion is not memory.

When a question shows two drawings and asks whether they are equivalent, write the four-row table for each, or apply one De Morgan pass and cancel double bubbles. If the tables match, the circuits are equivalent regardless of how many packages the original artist used.

Level 2 for B1 and B2 means you can apply these rewrites to a small aircraft discrete network, not merely recite the theorem names. The next section uses the same equivalents to build any function from NAND or NOR alone, and to read landing-gear and warning-lamp schematics.

Loading diagram... De Morgan equivalents and bubble pushing for combinational gates