In connection with Rand's Relational Data File (RDF), the class of proper formulas has been proposed as comprising those formalizations of questions to be processed by the RDF that are especially suitable for machine processing (see R-511 and RM-5428). The subclasses of proper formulas depend on the identity of the logical primitives employed. Different sets of primitives give rise to different classes of proper formulas.