On Feb 7, 3:25 pm, WM <mueck...@rz.fh-augsburg.de> wrote:
>... a subset S of the countable set F of finite words bijects with > the set D of definable numbers
Nope. Every D corresponds to some finite word. However, S, the collection of all the correspondences, may not be a subset of F (subsets must be computable). Hence we know D is sub-countable, but we do not know D is countable.