A characterization of the language invariant families satisfying spectrum exchangeability in polyadic inductive logic (Q636320)

After explaining the basic notions, the authors present, in terms of a de Finetti-style representation theorem, a complete characterization of the language-invariant probability functions in polyadic inductive logic which satisfy the spectrum exchangeability principle. This approach is then applied to show how to extend the continua of Carnap and Nix-Paris from purely unary language into the polyadic one whilst maintaining spectrum exchangeability.