Recursive function to replace all combinations of conditions (conditional text) to "Unconditional"

Can any one tell me how to write a recursive function that replaces all conditional combinations to "Unconditional"?

Let's say we have three conditions, A, B, and C.

I would need to replace

A -> Unconditional

B -> Unconditional

C -> Unconditional

A&B -> Unconditional

A&C -> Unconditional

B&C -> Unconditional

A&B&C -> Unconditional

This is just an example. A document may contain any number of conditions (maybe up to 10).

Thanks,

Tak