A representation theorem for probability functions in Pure Inductive Logic, and its applications.

Alena Vencovsk√° (Manchester)

Frank Adams 1,

I will outline a proof of a representation theorem for probability functions, which are defined on the set of sentences of a first order relational language and satisfy the exchangeability principle Ex. I will consider how the theorem could be used to investigate some proposed principles of analogy.

Import this event to your Outlook calendar
▲ Up to the top