<logic, decidable system, decidable wff> a (logical) language is said to be decidable iff all of its theorems (or logical truths) can be shown to be true through a finite mechanical procedure. Propositional logic is decidable; predicate logic is not.
Try this search on OneLook / Google