Exam Lookup

The set of all recursively enumerable languages is




Solution
B. closed under intersection



Explanation
The Set of RE languages is closed under intersection, not closed under complementation, is not a subset of set of REC language and is a countable set.