However , checking monadic decomposability is undecidable in general .
Decidability for certain theories is known
However , checking monadic decomposability is undecidable in general .
Decidability for certain theories is known ( e.g. Presburger Arithmetic , Tarski 's Real - Closed Field ) , but there are very few results regarding their computational complexity .