This preview shows page 1. Sign up to view the full content.
Unformatted text preview: is itself either nite or countable. (Hint: The proof is similar to the proof that the countable union of countable sets is countable, but you have to gure out how to deal with the nite sets. Dont make things too complicated; there is a very simple solution.) 4. Prove that the set of all nite subsets of N is countable....
View Full
Document
 Spring '10
 Math

Click to edit the document details