0 votes 0 votes Let $S_1$ be a countable set, $S_2$ a set that is not countable, and $S_1 \subset S_2$. Show that $S_2$ must then contain an infinite number of elements that are not in $S_1$. Show that in fact $S_2-S_1$ cannot be countable. Theory of Computation peter-linz peter-linz-edition5 theory-of-computation proof turing-machine recursive-and-recursively-enumerable-languages + – Rishi yadav asked Mar 16, 2019 Rishi yadav 195 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.