Recent content by Matrim

  1. M

    Proof that if the alphabet set is at most countable, then strings cnt

    What the authors mean to say is the that the a_i are terms of the alphabet and the subscript iterates over the items in the alphabet. But that was not clear to me...thank jgens.
  2. M

    Proof that if the alphabet set is at most countable, then strings cnt

    Ah...well that is much nicer. And it cleanly accounts for position. However, I don't see how what the author(s) wrote and what you are wrote are the same...there is the same subscript, i, for all the alphabet items in the definition of β Then these are iterated over...which means (to my eyes)...
  3. M

    Proof that if the alphabet set is at most countable, then strings cnt

    Lemma: If A is an at most countable alphabet, then the set A^* of strings over A is countable. Proof begin: Let p_n be the n^{th} prime number: p_0 = 2, p_1=3, p_2=5, and so on. If A is finite, say A = {a_0, a_1, ... , a_n}, where a_0, a_1, ... , a_n are pairwise distinct, or if A is countable...
Back
Top