Related papers: De Finetti for mathematics undergraduates
In a recent paper, Amini et al. introduce a general framework to prove duality theorems between special decompositions and their dual combinatorial object. They thus unify all known ad-hoc proofs in one single theorem. While this…
D'Alembert made the first serious attempt to prove the Fundamental Theorem of Algebra (FTA) in 1746. An elementary proof of (FTA) based on the same idea is given in Proofs from THE BOOK. We give a shorter and more transperant version of…
Feferman proved in 1962 that any arithmetical theorem is a consequence of a suitable transfinite iteration of full uniform reflection of $\mathsf{PA}$. This result is commonly known as Feferman's completeness theorem. The purpose of this…
We show the following generalizations of the de Finetti--Hewitt--Savage theorem: Given an exchangeable sequence of random elements, the sequence is conditionally i.i.d. if and only if each random element admits a regular conditional…
This paper explores trivalent truth conditions for indicative conditionals, examining the "defective" table put forward by de Finetti 1936, as well as Reichenbach 1944, first sketched in Reichenbach 1935. On their approach, a conditional…
This is the second in a series of articles aimed at exploring the relationship between the complexity classes of P and NP. The research in this article aims to find conditions of an algorithmic nature that are necessary and sufficient to…
We survey known solutions to the infinite extendibility problem for (necessarily exchangeable) probability laws on $\mathbb{R}^d$, which is: Can a given random vector $\vec{X} = (X_1,\ldots,X_d)$ be represented in distribution as the first…
We show that G\"odel's negative results concerning arithmetic, which date back to the 1930s, and the ancient "sand pile" paradox (known also as "sorites paradox") pose the questions of the use of fuzzy sets and of the effect of a measuring…
A relationally exchangeable structure is a random combinatorial structure whose law is invariant with respect to relabeling its relations, as opposed to its elements. Aside from exchangeable random partitions, examples include edge…
Stemming from de Finetti's work on finitely additive coherent probabilities, the paradigm of coherence has been applied to many uncertainty calculi in order to remove structural restrictions on the domain of the assessment. Three possible…
This short note gives a positive answer to an old question in elementary probability theory that arose in Furstenberg's seminal article "Disjointness in Ergodic Theory." As a consequence, Furstenberg's filtering theorem holds without any…
For a given intuitionistic propositional formula A and a propositional variable x occurring in it, define the infinite sequence of formulae { A \_i | i$\ge$1} by letting A\_1 be A and A\_{i+1} be A(A\_i/x). Ruitenburg's Theorem [8] says…
We study sequences of noncommutative random variables which are invariant under "quantum transformations" coming from an orthogonal quantum group satisfying the "easiness" condition axiomatized in our previous paper. For 10 easy quantum…
We establish an equivalence between two seemingly different theories: one is the traditional axiomatisation of incomplete preferences on horse lotteries based on the mixture independence axiom; the other is the theory of desirable gambles…
This article examines differentiability properties of the value function of positioning choice problems, a class of optimisation problems in finite-dimensional Euclidean spaces. We show that positioning choice problems' value function is…
For a class of random partitions of an infinite set a de Finetti-type representation is derived, and in one special case a central limit theorem for the number of blocks is shown.
Dummett's argument for intuitionism is well known. There is a concern that the argument proves too much, specifically, that it supports the extreme and apparently incoherent position of strict finitism. The central question is how to…
Let $A_1, A_2, \ldots, A_n$ be events in a sample space. Given the probability of the intersection of each collection of up to $k+1$ of these events, what can we say about the probability that at least $r$ of the events occur? This question…
Considerable thought has been devoted to an adequate definition of the class of infinite, random binary sequences (the sort of sequence that almost certainly arises from flipping a fair coin indefinitely). The first mathematical exploration…
A causal structure is a description of the functional dependencies between random variables. A distribution is compatible with a given causal structure if it can be realized by a process respecting these dependencies. Deciding whether a…