The number of two-way tables satisfying certain additivity axioms

An expression is given for the number of ways of ranking the cells of an r by c factorial design so as to satisfy independence. For selected values of r and c, estimates are given of the number of rankings that satisfy both independence and double cancellation, and also of the number of rankings allowing an additive representation. These results may be used in at least two ways: first, in evaluating the probability of the satisfaction of certain measurement axioms by chance; and second, in placing a lower bound on the amount of information necessary to establish the ordering of the cells of a factorial design when it is known that these axioms are satisfied.