On 2010-06-18, Virgil <Virgil@home.esc> wrote: > Given the axiom of choice, as in ZFC, any countable set must be, at > least theoretically, listable, though such a listing need not be > computable.
The definition of countability is the existence of a bijection with a subset of N. Since N can be well-ordered even in ZF, the theorem (countable -> listable) is easily proven without AC.
