in Set Theory & Algebra
231 views
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.
in Set Theory & Algebra
by
231 views

Please log in or register to answer this question.

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true