Lightning Talk: Why False Is Less Than True in Boolean Algebra
summary
Argues that false is less than true because Booleans generalize to predicates: treat true as the universal set and false is the empty set, order predicates by set inclusion, and use that ordering to explain implication. Demonstrates with truth tables and set diagrams that a implies b holds exactly when the set for a is a subset of b — summarized as implication == subset — and notes how a hypothetical C++ implication operator would mirror ≤, causing potential operator-name confusion.
AI-written summary · about
related talks
05mTell Me Lies, Tell Me Lies, Tell Me Sweet Little Lies
05mProof-carrying types
58mUsing C++20's Three-way Comparison ＜=＞
05mSFINAE: Substitution Failure Is Not An Error
59mTheory makes beautiful programs
01h 08mRegular Types and Why Do I Care ?
06mLightning Talk: How Hard Can it be to SFINAE in C++03?
05mVariants of variadic AND