arXiv (All)
open access
Reduction of Database Independence to Dividing in Atomless Boolean Algebras
We prove that the form of conditional independence at play in database theory and independence logic is reducible to the first-order dividing calculus in the theory of atomless Boolean algebras. This establishes interesting connections between independence in database theory and stochastic independe
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Dependence Logic in Pregeometries and $ω$-Stable Theories#1390091
- Independence Logic and Abstract Independence Relations#1390092
- An observation on Carnapʼs Continuum and stochastic independencies#758976
- Conjunction, disjunction and iterated conditioning of conditional events#736384
- A Concept of Independence with Applications in Various Fields of Mathematics#452382
Record · ID 1390093
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive