Representation Theorems for Strong Predicate Exchangeability in Pure Inductive Logic
Logic
2015-07-02 v1
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.
Keywords
Cite
@article{arxiv.1507.00046,
title = {Representation Theorems for Strong Predicate Exchangeability in Pure Inductive Logic},
author = {Malte S. Kließ},
journal= {arXiv preprint arXiv:1507.00046},
year = {2015}
}