2000 character limit reached
A countable Boolean algebra that is Reichenbach's common cause complete
Published 24 Jan 2025 in math.LO, math-ph, and math.MP | (2501.14567v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.