We have seen that from the viewpoint of model theory, statements formed by means of logical operators can be simply eliminated with the help of a couple of recursive constraints reducing satisfaction of such statements to satisfaction of their substatements. The idea flowing from this is to handle quantificational statements analogously; to find analogous recursive constraints for quantificational statements. Attempting this, though, we immediately face a problem — quantificational statements do not in general contain substatements, at least not in the overt way those formed by means of logical operators do.