The class of Recursively Enumerable Languages is closed under Union,  and Intersection but they are not closed under Complement.I know why they are not closed under Complement & why they are closed under Union & Intersection but for other classes of languages we use a reasoning for closures based on the De'Morgan Law: $A \cap B = \widehat{\widehat{A}\cup \widehat{B}}$That is,If some language class is closed under any two of the three operations namely, Union, Intersection & Complement then it must be closed under the third.So what's wrong with the class of Recursively Enumerable Languages?are not they sets?Or am I using implication incorrectly?
Why $A \cap B = \widehat{\widehat{A}\cup \widehat{B}}$ does not holds for the class of Recursively Enumerable Languages?
closure properties
The claim If some language class is closed under any two of the three operations namely, Union, Intersection & Complement then it must be closed under the third. is not accurate.  I'm not sure where you got it from, but it's not correct.Recursively enumerable languages are closed under union and intersection.  However, they're not closed under complement.  And, there's no way to express complement using just union and intersection.  So, the fact that they're closed under union and intersection does not imply that they're closed under complete.  There's no paradox/contradiction here.