Prove or disprove: every countable union of recursive sets is recursive.

609 Views Asked by At

How can I prove or disprove that every countable union of recursive sets is recursive?

What about recursive enumerable (r.e.)? How can I prove or disprove that every countable union of r.e. sets is r.e.?

Please help me, I really appreciate it.

1

There are 1 best solutions below

0
On

Take your favourite non-recursively enumerable set of natural numbers. It is countable. It is therefore a countable union of singletons, each containing one number. Singletons are r.e. and recursive. So ....