The principle of signature exchangeability.

We investigate the notion of a signature in Polyadic Inductive Logic and study the probability functions satisfying the Principle of Signature Exchangeability . We prove a representation theorem for such functions on binary languages and show that they satisfy a binary version of the Principle of Instantial Relevance. We discuss polyadic versions of the Principle of Instantial Relevance and Johnson's Sufficientness Postulate. [ABSTRACT FROM AUTHOR]