Before revision: 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 .
After revision: 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 false .