Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2301.09327

Subjective probability, trivalent logics and compound conditionals

Angelo Gilio·Giuseppe Sanfilippo
View original source ↗Read source document ↗Export metadata ↓

Abstract

In this work we first illustrate the subjective theory of de Finetti. We recall the notion of coherence for both the betting scheme and the penalty criterion, by considering the unconditional and conditional cases. We show the equivalence of the two criteria by giving the geometrical interpretation of coherence. We also consider the notion of coherence based on proper scoring rules. We discuss conditional events in the trivalent logic of de Finetti and the numerical representation of truth-values. We check the validity of selected basic logical and probabilistic properties for some trivalent logics: Kleene-Lukasiewicz-Heyting-de Finetti; Lukasiewicz; Bochvar-Kleene; Sobocinski. We verify that none of these logics satisfies all the properties. Then, we consider our approach to conjunction and disjunction of conditional events in the setting of conditional random quantities. We verify that all the basic logical and probabilistic properties (included the Fr\'{e}chet-Hoeffding bounds) are preserved in our approach. We also recall the characterization of p-consistency and p-entailment by our notion of conjunction.

Explore related subjects

math.PRmath.LO

Keep this discovery

BibTeXRIS

Angelo Gilio, Giuseppe Sanfilippo. 2023-01-23. Subjective probability, trivalent logics and compound conditionals. https://arxiv.org/abs/2301.09327

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR↗
arXiv2026

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR↗
arXiv2026

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR↗