What are the closure properties of decidable languages?

Decidable languages are closed under union, intersection, concatenation, and Kleene star operations. This means that if two languages are decidable, their union, intersection, concatenation, and Kleene star are also decidable.