Revisiting the logical independence

Abstract

It has been widely acknowledged that probabilistic independence and logical independence cannot be coherently reconciled. By bridging these two notions, this paper addresses three long-standing problems that have puzzled the field of probability theory: Should probability be defined prior to independence, or independence prior to probability? How ought independence to be formulated for signed measures and families of probability measures? Why do the conclusions of classical limit theorems remain valid even when practical scenarios violate their underlying assumptions? By introducing logical independence and σ-logical independence, we establish the probability extension theorem. This result not only demonstrates that independence ought to be defined before probability, but also endows logical independence with probabilistic machinery, thereby rendering it computationally tractable in the same manner as probabilistic independence. Then, we investigate how independence should be defined when multiple measures are involved. Finally, we prove that limit theorems can hold true under two intuitive conditions: σ-logical independence and identical range of random variables.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…