Representation Theorems for Strong Predicate Exchangeability in Pure Inductive Logic
From MaRDI portal
Abstract: In Pure Inductive Logic, the principle of Strong Predicate Exchangeability is a rational principle based on symmetry that sits in between the principles of Predicate Exchangeability and Atom Exchangeability. We will show a de Finetti - style representation theorem for probability functions that satisfy this principle in addition to Unary Language Invariance.
This page was built for publication: Representation Theorems for Strong Predicate Exchangeability in Pure Inductive Logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6263175)
