Why an Empty List Is 'True': The Logic Behind Python's all()

A short teaching excerpt from the ‘Logic for Programmers’ project uses Python’s all() to illustrate a foundational idea in formal reasoning: identity elements. Because all() behaves like chaining values together with logical AND, it satisfies a clean composition rule — the result of checking a concatenated list equals the results of checking each part combined with AND. The interesting question is what happens at the edges, specifically when one of those parts is the empty list.

Working through the algebra, the author shows the rule only stays consistent if all([]) returns True. If it returned False instead, every list would collapse to False regardless of its contents, breaking the composition property. True is therefore the ‘identity’ of AND: combining anything with True leaves it unchanged. The same reasoning explains other seemingly arbitrary base cases, such as sum([]) being 0 and any([]) being False.

The piece is a compact example of how formal logic clarifies design decisions that programmers usually accept as convention. Rather than treating empty-collection behavior as a quirk to memorize, it frames these defaults as the only choices that preserve mathematical consistency — a useful lens for anyone reasoning about program correctness and edge cases.