Countable
finite or bijective to
Constructing bijection (Theorem 3.3)
Language of finite alphabets is countable (Theorem 3.4)
3.5
3.6
Power set of infinite sets (Theorem 3.7)
3.8 strings