0 votes 0 votes Prove that if it is possible to label each element of an infinite set $S$ with a finite string of keyboard characters, from a finite list characters, where no two elements of $S$ have the same label, then $S$ is a countably infinite set. Set Theory & Algebra kenneth-rosen discrete-mathematics set-theory&algebra descriptive + – admin asked Apr 21, 2020 admin 246 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.