Results 1 to 3 of 3

Math Help - |all finite sentences| (countable alphabet) = countable, right?

  1. #1
    Member
    Joined
    Aug 2010
    Posts
    130

    |all finite sentences| (countable alphabet) = countable, right?

    That is, the cardinality of the set of all finite sentences, when the alphabet is countable infinite -- I have the impression that this is countable, but when attempting to prove it, I end up making my collection look the same as an uncountable collection. Any pointers?
    Follow Math Help Forum on Facebook and Google+

  2. #2
    Banned
    Joined
    Oct 2009
    Posts
    4,261
    Quote Originally Posted by nomadreid View Post
    That is, the cardinality of the set of all finite sentences, when the alphabet is countable infinite -- I have the impression that this is countable, but when attempting to prove it, I end up making my collection look the same as an uncountable collection. Any pointers?

    The set of all finite sentences is the (at most) infinite countable union of the set of all sentences of one letter and

    the set of all sentences of two letters and...etc.

    As a countable union of countable sets is countable we're done.

    Tonio
    Follow Math Help Forum on Facebook and Google+

  3. #3
    Member
    Joined
    Aug 2010
    Posts
    130
    That makes sense. Thanks, Tonio.
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Replies: 5
    Last Post: January 9th 2013, 06:14 AM
  2. Finite, Countable, or Uncountable?
    Posted in the Discrete Math Forum
    Replies: 10
    Last Post: September 28th 2011, 03:29 PM
  3. Replies: 1
    Last Post: February 9th 2010, 01:51 PM
  4. Prove every subset of N is either finite or countable
    Posted in the Discrete Math Forum
    Replies: 1
    Last Post: January 1st 2009, 01:57 AM
  5. Replies: 11
    Last Post: October 11th 2008, 06:49 PM

Search Tags


/mathhelpforum @mathhelpforum