๐Ÿ’ปap computer science a review

DeMorgan's Theorems

Written by the Fiveable Content Team โ€ข Last updated September 2025
Verified for the 2026 exam
Verified for the 2026 examโ€ขWritten by the Fiveable Content Team โ€ข Last updated September 2025

Definition

DeMorgan's Theorems state two rules for simplifying logical expressions involving negations (NOT), conjunctions (AND), and disjunctions (OR). These rules allow us to switch between negating individual terms and negating the entire expression.

"DeMorgan's Theorems" also found in: