boolalg__source
Truth tables, step-by-step simplification, and algebraic proofs for Boolean
- Version:
- 1.0.0
- Copyright:
- Param Srivastava
- License:
- lppl1.3c
- Packaged on:
- 11/08/2026 12:17:54
- Number of files:
- 2
- Size on disk:
- 5.25 kB
The boolalg package provides pure-TeX macros for parsing, evaluating, simplifying, and proving Boolean algebra expressions without requiring external tools, Python, or shell-escape: – \btable and \btable*: Generate truth tables with intermediate subexpression columns and optional simplified results. – \bsimplify and \bsimplify*: Perform step-by-step algebraic simplification with explicit law justifications (Idempotence, Absorption, Consensus theorem, De Morgan’s laws, Distributivity, etc.). – \bprove: Construct step-by-step algebraic proofs between two equivalent expressions, or automatically find and print a concrete counterexample if the claim is false. Expressions support flexible input syntax including implicit multiplication (AB), postfix primes (A'), prefix operators (!, ~), English words (and, or, xor, nand, nor, xnor, not), and standard LaTeX math symbols (\land, \lor, \oplus, \lnot, etc.).