From Babel to Boole: the logical organization of information decompositions

The field of partial information decomposition (PID) has become increasingly fragmented, with various proposed solutions approaching the problem from distinct perspectives. At the heart of each proposal lies what we call a PID-inducing concept —a type of information that, once formally specified, determines the PID components. Traditionally, redundancy has been the PID-inducing concept of choice, but other concepts, such as synergy, unique information and union information, have also been used. However, no cohesive logical framework exists to unify these approaches and clarify their relationships, particularly in the general case of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mi>n</mml:mi> </mml:math> information sources. In this work, we introduce a unifying framework that connects PID components to Boolean functions and identifies PID-inducing concepts with logical conditions on these functions. We demonstrate that all existing PID-inducing concepts are special cases of this general construction. We also introduce novel concepts, including vulnerable information and partner concepts , and provide a comprehensive analysis of their properties, lattice structures and interrelationships.

Authors

Institutions

Publication Details

Journal
Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences
Published
2025-03-01
DOI
https://doi.org/10.1098/rspa.2024.0174
Citations
4
Primary Topic
Computability, Logic, AI Algorithms
Type
article
Field-Weighted Citation Impact
6.02

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

From Babel to Boole: the logical organization of information decompositions

Abdullah Makkeh, Aaron J. Gutknecht, Michael Wibral
4 citations
Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences
Computability, Logic, AI Algorithms
6.02
article

From Babel to Boole: the logical organization of information decompositions

Abdullah Makkeh, Aaron J. Gutknecht, Michael Wibral
article en
4 citations

Abstract

The field of partial information decomposition (PID) has become increasingly fragmented, with various proposed solutions approaching the problem from distinct perspectives. At the heart of each proposal lies what we call a PID-inducing concept —a type of information that, once formally specified, determines the PID components. Traditionally, redundancy has been the PID-inducing concept of choice, but other concepts, such as synergy, unique information and union information, have also been used. However, no cohesive logical framework exists to unify these approaches and clarify their relationships, particularly in the general case of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mi>n</mml:mi> </mml:math> information sources. In this work, we introduce a unifying framework that connects PID components to Boolean functions and identifies PID-inducing concepts with logical conditions on these functions. We demonstrate that all existing PID-inducing concepts are special cases of this general construction. We also introduce novel concepts, including vulnerable information and partner concepts , and provide a comprehensive analysis of their properties, lattice structures and interrelationships.

Proceedings of the Royal Society A Mathematical Physical and Engineering SciencesVol. 481(2310)
Goethe University Frankfurt (DE), Goethe-Institute United Kingdom (GB), University of Göttingen (DE)
Volkswagen Foundation
Openalex Percentile: Top 4%
Computability, Logic, AI Algorithms
6.02
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.