Decidability of every set implies the law of excluded middle as soon as there is a "subobject classifier".
Indeed, for every proposition $U$, the fact that "$U = True$ or $U \neq True$" is exactly the same as $U$ or not $U$.
Decidability of every set implies the law of excluded middle as soon as there is a "subobject classifier".
Indeed, for every proposition $U$, the fact that "$U = True$ or $U \neq True$" is exactly the same as $U$ or not $U$.