I'm trying to figure out how to prove or disprove the following statement:
Infinite union of recursive languages is recursively enumerable.
I know how to prove that infinite union of regular languages is not recursive, but I can't figure out how to prove the statement above. Intuition is telling me that the statement is true, but I'm not sure. Does anybody know how would I go about it?
Any help is greatly appreciated.