Resolvable Set

The following article is from The Great Soviet Encyclopedia (1979). It might be outdated or ideologically biased.

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.

The Great Soviet Encyclopedia, 3rd Edition (1970-1979). © 2010 The Gale Group, Inc. All rights reserved.