Decidability for certain theories is known
but there are very few results
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 .
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 .