Pure Inductive Logic with Functions

Jeff Paris (Manchester)

Frank Adams 2,

In joint work with Liz Howarth we have recently found a representation theorem for probability functions satisfying Constant Exchangeability on a language with functions (well, actually, just one unary function).  In my talk I will explain the nature of this representation why such a result had previously seemed out of reach.

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