2000 character limit reached
Predicate Exchangeability and Language Invariance in Pure Inductive Logic
Published 4 May 2013 in math.LO | (1305.0925v1)
Abstract: In Pure Inductive Logic, the rational principle of Predicate Exchangeability states that permuting the predicates in a given language L and replacing each occurrence of a predicate in an L-sentence $\phi$ according to this permutation should not change our belief in the truth of $\phi$. In this paper we study when a probability function w on a purely unary language L satisfying Predicate Exchangeability also satisfies the principle of Unary Language Invariance.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.