decidable predicate

decidable predicate

[di′sīd·ə·bəl ′pred·ə·kət]
(mathematics)
A predicate for which there exists an algorithm which, for any given value of its independent variables, provides a definite answer as to whether or not it is true.