vix.ing · top · new · best · stats · spec

A countable Boolean algebra that is Reichenbach's common cause complete

2025/01/24 by Dominika Burešová, Burešová, Dominika
Computer Science · #06C15 #81P05 #81P10 #Advanced Algebra and Logic #FOS: Mathematics #FOS: Physical sciences #Logic (math.LO) #Mathematical Physics (math-ph)

paper · pdf · doi:10.48550/arxiv.2501.14567

openalex publication_date 2025/01/24 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/31

Abstract

The common cause completeness (CCC) is a philosophical principle that asserts that if we consider two positively correlated events then it evokes a common cause. The principle is due to H. Reichenbach and has been largely studied in Boolean algebras and elsewhere.The results published so far bring about a question whether there is a small (countable) Boolean algebra with CCC. In this note we construct such an example.

Related