Representation theorems for probability functions satisfying spectrum exchangeability in inductive logic

We prove de Finetti style representation theorems covering the class of all probability functions satisfying spectrum exchangeability in polyadic inductive logic and give an application by characterizing those probability functions satisfying spectrum exchangeability which can be extended to a language with equality whilst still satisfying that property.