A Counter Example to Theorems of Cox and Fine

05/27/2011
by   J. Y. Halpern, et al.
0

Cox's well-known theorem justifying the use of probability is shown not to hold in finite domains. The counterexample also suggests that Cox's assumptions are insufficient to prove the result even in infinite domains. The same counterexample is used to disprove a result of Fine on comparative conditional probability.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/15/2020

Some complete ω-powers of a one-counter language, for any Borel class of finite rank

We prove that, for any natural number n ≥ 1, we can find a finite alphab...
research
03/02/2022

A Modern Gauss-Markov Theorem? Really?

We show that the theorems in Hansen (2021a) (the version accepted by Eco...
research
12/21/2020

Copula Measures and Sklar's Theorem in Arbitrary Dimensions

Although copulas are used and defined for various infinite-dimensional o...
research
04/30/2019

Query-to-Communication Lifting Using Low-Discrepancy Gadgets

Lifting theorems are theorems that relate the query complexity of a func...
research
02/06/2015

A Generalization of the Borkar-Meyn Theorem for Stochastic Recursive Inclusions

In this paper the stability theorem of Borkar and Meyn is extended to in...
research
11/07/2019

Uncertainty relations and fluctuation theorems for Bayes nets

The pioneering paper [Ito and Sagawa, 2013] analyzed the non-equilibrium...
research
02/07/2023

Strictly Frequentist Imprecise Probability

Strict frequentism defines probability as the limiting relative frequenc...

Please sign up or login with your details

Forgot password? Click here to reset