Theoremintro
Shannon expansion
Also called Shannon decomposition, Boole's expansion theorem.
Every boolean function f equals x·f|x=1 + x'·f|x=0, the recursion behind BDDs.
Every boolean function f equals x·f|x=1 + x'·f|x=0, the recursion behind BDDs.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag FPPA26 Edit this page History Report an error