The set of all recursively enumerable languages is , The set of all recursively enumerable languages is

A. closed under complementation

B. closed under intersection

C. a subset of the set of all recursive languages

D. an uncountable set

Correct Answer :

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.