The aim of this paper is to present a decision procedure which seems to be as easy to use as other available procedures in quantification theory, but which is considerably stronger than the others, providing a mechanical test for a sub-species of polyadic validity which is very much broader than monadic validity. Of course, a test for polyadic validity in general is out of the question, but the present test's limits, short of polyadic validity, are not known. That is, of all the polyadically valid schemata which have been tested, ncne has failed to yield decisions under this method. The material thus examined includes schemata corresponding to the cases of all absolute metatheorems in ML's Chapters II and III, and five polyadic samples from MeL. The handiness of this test is illustrated by sample applications in § 3 below.