Introduction
The assertion that reality can be modeled as a set of metadata-value tuples—(Metadata, Value)—presents a robust framework for information theory. However, it encounters an immediate epistemological challenge: How does a formal system handle missing data, or worse, metadata attributes whose very existence is unknown? Former U.S. Secretary of Defense Donald Rumsfeld famously categorized knowledge into “known knowns,” “known unknowns,” and “unknown unknowns.” To remain valid representations of reality, formal logic and computer science must possess rigorous mechanisms to model both missing values and the structural limits of human awareness.
Modeling “Known Unknowns”: The Null Symbol
The simplest category of missing information involves attributes whose existence is known, but whose specific values remain unobserved or unmeasured—the “known unknowns.”
In data engineering and formal logic, this problem is solved through the introduction of a specialized placeholder known as the Null symbol or bottom type (Bottom symbol (⊥)). When an attribute exists structurally but lacks data, the set incorporates a tuple with an explicit empty state:
(Artifact_1, Creation Date, NULL)
This tuple does not indicate that the artifact lacks a creation date in reality; rather, it explicitly states within the mathematical system that the attribute “Creation Date” is present as a structural dimension, but its corresponding value is currently unobserved. The system successfully models presence paired with absence.
Modeling “Unknown Unknowns”: The Open World Assumption
A far more profound epistemological challenge arises with “unknown unknowns”—attributes or metadata dimensions whose existence we have not yet conceived. If a system cannot even define the key, how can it construct the pair?
Formal logic addresses this boundary through two contrasting architectural paradigms:
By adopting the Open World Assumption, set theory avoids the trap of false completeness. It treats the current metadata set S not as the totality of the universe, but as an open, evolving subset (S ⊂ U) designed to absorb newly discovered dimensions of metadata as human knowledge expands.
The Limits of Description: Gödelian Incompleteness
At the deepest theoretical level, the problem of unknown metadata converges with Kurt Gödel’s Incompleteness Theorems. Gödel proved that within any consistent formal axiomatic system capable of doing basic arithmetic, there are truths that cannot be proven inside the system itself.
Transposed to information theory, Gödel’s insight implies that no static set of metadata-value pairs can ever achieve absolute closure. There will always exist metadata dimensions outside the boundaries of any formal system. The set can describe everything we have mapped, but it remains surrounded by an “unmapped void”—a domain of potential attributes that remain invisible until a new paradigm brings them into awareness.
Conclusion
Formal systems do not collapse when confronted with the unknown; rather, they adapt their logical syntax. “Known unknowns” are integrated cleanly through null values and explicit empty sets. “Unknown unknowns” are accommodated structurally by framing set theory through the Open World Assumption, recognizing that every knowledge set is an evolving subset rather than a closed universe. While set theory cannot list metadata that has not yet been conceived, it provides the open architecture necessary to integrate new dimensions of reality whenever we discover them.
If you enjoyed this piece:
Explore the “Noise Cancelling” collection
Discover more from the Abstract collection
Leave a Reply