"Similar criticisms seem to us to apply to the original and elegant formal development given by Cox (1946, 1961) and Jaynes (1958), who showed that the probability axioms constitute the only consistent extension of ordinary (Aristotelian) logic in which degrees of belief are represented by real numbers."

Bernardo and Smith, 2000, page 90

"R. T. Cox (1946) published a paper that showed that any set of rules for inference, in which we
represent degrees of plausibility by real numbers, is necessarily either equivalent to the Laplace-
Jeffreys rules, that is (1)-(3), or inconsistent."

Evans (2002)

"Cox’s argument (see Chapter 2) for obtaining a quantitative representation for qualitative or comparative axioms about conditioning, a goal essential to Jaynes’s program, has been re-examined carefully by Halpern (J.Y. Halpern, “Cox’s Theorem Revisited,” *Journal of Artificial Intelligence Research*, Vol. 11, 1999, pp. 429-435). When we restrict ourselves to finitely many propositions, as advocated by Jaynes, some technicalities must be addressed if we are to reach the conclusion desired by Jaynes; in my view and Halpern’s, the assumptions required are not as compelling as glossing over them makes them appear."

Fine, 2004 (book review)

"The reason for this is clear to one who has studied the theorems of R. T. Cox (1946, 1961). He shows that any method of pausible reasoning in which we represent degrees of plausibility by real numbers, is necessarily either equivalent to Laplace's, or inconsistent."

Jaynes, "Jaynes' reply to Kempthorne's Comments", In: Rosenkrantz (1989), pages 192-193,

"Thus, Cox proved that any method of inference in which we represent degrees of plausibility by real numbers, is necessarily either equivalent to Laplace's, or inconsistent."

Jaynes, "Where do we stand on Maximum Entropy?", In: Rosenkrantz (1989), page 220

"Cox proved that it is the only consistent extension of logic in which degrees of plausibility are represented by real numbers"

Jaynes, "What is the Question?", In: Rosenkrantz (1989), page 382

"It is clear that, not only is the quantitative use of the rules of probability theory as extended logic the only sound way to conduct inference; is is the *failure* to follow those rules strictly that has for many years been leading to unnecessay errors, paradoxes, and controversies."

Jaynes (2003), page 143

"...the rules of probability theory can be derived as necessary conditions for consistency, as expressed by Cox’s functional equations." Jaynes (2003), page 486

"A third justification for belief as probability (or at least a scaled version of probability) appeared in a paper by R.T. Cox in the American Journal of Physics in 1946 [9]. Cox's proof is not, perhaps, as rigorous as some pedants might prefer and when an attempt is made to fill in all the details some of the attractiveness of the original is lost. Nevertheless his results certainly provide a valuable contribution to our understanding of the nature of belief.

We state here a rigorous version of Cox's main theorem which has aspects which are both stronger and weaker than the original. Slightly stronger versions still can be proved but the increased complications do not seem to justify doing so."

Paris, 1994, page 24

"Kolmogorov (1950) is widely quoted as the author of the axiomatic basis of probability calculus, but it was R.T. Cox (1946, 1961) who showed that no other calculus is admissible. The only freedom is to take some monotonic function instead, such as 100 Pr() (percentage) or Pr()=(1 ?? Pr()) (odds), but such changes are merely cosmetic. It follows that other methods are either equivalent to probability calculus (in which case they are unnecessary), or are wrong."

Skilling, 1998

- ABEL, Niels Henrik, "Untersuchung der Functionen zweier unabh�ngig ver�nderlichen Gr�szen x und y, wie f(x, y), welche die Eigenschaft haben, dasz f[z, f(x,y)] eine symmetrische Function von z, x und y ist.", Jour. Reine u. angew. Math. (Crelle's Jour.), 1, 11-15, (1826).
- ARNBORG, S. and G. SJ�DIN, On the foundations of Bayesianism
- ARNBORG, Stefan and Gunnar SJ�ODIN, What is the plausibility of probability?(revised 2003)
- COLYVAN, Mark, The Philosophical Significance of Cox�s Theorem
- COX, R. T., Probability, Frequency, and Reasonable Expectation, Am. Jour. Phys., 14, 1-13, (1946). [Cited by 195]
- COX, R. T., The Algebra of Probable Inference, Johns Hopkins University Press, Baltimore, MD, (1961).
- DE FINETTI, Bruno, La �Logica del Plausible� secondo la concezione di Polya, Atti della XLII Ruinuone della Societa Italiana per il Progresso delle Scienze, (1949 (1951)), 1-10.
- FINE, Terrence L., �Theories of Probability � an Examination of Foundations,� Academic Press, New York, 1973.
- HALPERN, Joseph Y., Cox's Theorem Revisited, Journal of Artificial Intelligence Research 11 (1999) 429{435
- HALPERN, Joseph Y., Technical Addendum, Cox's Theorem Revisited, Journal of AI research, 11, 429-435 (1999)
- HALPERN, Joseph Y., A Counterexample to Theorems of Cox and Fine, 1999. [Cited by 26]
- HARDY, Michael, Scaled Boolean Algebras, 2002.
- SHAFER, Comments on �Constructing a Logic of Plausible Inference: A Guide to Cox�s Theorem�, by Kevin S. Van Horn
- SKILLING, John, Probabilistic Data Analysis; An Introductory Guide
- SNOW, P., On the Correctness and Reasonableness of Cox's Theorem for Finite Domains, Computational Intelligence, Volume 14, Number 3, August 1998, pp. 452-459(8)
- VAN HORN, Kevin S., Constructing a Logic of Plausible Inference: A Guide to Cox’s Theorem, 2003 [Cited by 3]
- Fuzzy archive: Re: Fuzzy logic compared to probability
- Yahoo! Groups : genetic_programming Messages : Message 1386 of 3625
- Scoring rules and the inevitability of probability