Example 11.6.4. A proposition \(P\), regarded as a set, is finite if and only if it is decidable. Indeed, decidability identifies \(P\) either with the empty set or with the one-point set. Conversely, a cardinal presentation of \(P\) decides \(P\): cardinal zero gives \(\neg P\), and a positive cardinal gives a term of \(P\). Since decidability of a proposition is itself a proposition, the mere existence of a cardinal presentation suffices.

From Section 11.6, Finite and \(\pi\)-finite animae.