Are decidable languages closed under any operations?

Yes, decidable languages are closed under operations such as union, intersection, concatenation, and complementation. This means that if a language is decidable, performing these operations on it will result in another decidable language.