 In intuitionistic logic A predicate P over some domain is called decidable if for every x in the domain, either P(x) is true, or P(x) is not true , which is not always the case constructively.
<fluency>  In intuitionistic logic A predicate P over some domain is called decidable if for every x in the domain, either P(x) is true, or P(x) is not true , which is not always the case constructively.
 In Intuitionistic logic In predicate logic, a predicate P over some domain is called decidable if for every x in the domain, either P(x) is true, or P(x) is not true , which is not always the case constructively.