Resolvable Set

in logic, a set located in some aggregate of constructive objects—that is, a set composed of some objects in this aggregate—for which there exists an algorithm that resolves this set (with respect to the enclosing set) in the following sense: the algorithm is applicable to any object of the enclosing set and tells whether or not this object belongs to the set in question.