2000 character limit reached
Representation Theorems for Strong Predicate Exchangeability in Pure Inductive Logic
Published 30 Jun 2015 in math.LO | (1507.00046v1)
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.
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.