🔢 mathematics

Quantum uncertainty in a macroscopic domain

This paper develops a classical model-theoretic framework using partial Boolean algebras to demonstrate that quantum-like uncertainty and the Kochen-Specker theorem can arise from the structural organization of propositions and models without abandoning classical propositional logic.

Original authors: Othman Q. Malhas, Bacim Alali

Published 2026-08-11

📖 6 min read🧠 Deep dive

CC BY 4.0

Original authors: Othman Q. Malhas, Bacim Alali

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). ✨ This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

The Rules of the Game: When Logic Gets Tricky

Imagine you are playing a game of "True or False" with a friend. In the everyday world, the rules are simple: a statement is either true or false, and if you know the answer to one question, you can often figure out the answer to another. This is the world of classical logic, the same kind of math that runs your computer and helps you build a Lego castle. It assumes that every piece of information fits together perfectly into one big, consistent picture.

But then, there's the weird world of quantum physics. This is the science of the very small—atoms, electrons, and light particles. In this tiny realm, the rules seem to break. You can't always know everything about a particle at once. If you measure where it is, you lose information about how fast it's moving. It's as if the universe itself refuses to let you have a complete, sharp picture of reality all at once. Scientists call this "uncertainty" and "contextuality," meaning the answer you get depends on how you ask the question. For decades, people thought this meant the universe wasn't following the standard rules of logic at all. But what if the universe is following the rules, just in a way that looks weird because of how the questions are organized?

The Paper's Big Idea: A New Map for a Weird World

This paper, written by Othman Q. Malhas and Bacim Alali, asks a fascinating question: Can we explain these strange quantum behaviors using only the standard, boring rules of classical logic? The authors say yes. They don't need to invent new, magical logic to explain the quantum world. Instead, they show that if you organize your "True or False" statements in a very specific, tricky way, the standard rules of logic naturally produce the same kind of uncertainty and confusion that we see in quantum physics.

Think of it like a massive, interconnected maze. In a normal maze, if you know where you are, you know exactly where you can go next. But in this "quantum" maze, the paths are arranged so that knowing your location on one path blocks you from knowing your location on another path, even though both paths are part of the same map. The authors built a mathematical model to prove that you can create these "blocked" paths using only standard logic. They didn't change the rules of the game; they just showed that the structure of the game board can force you to be uncertain.

The Two Worlds: The 12-Vertex and the 140-Vertex

To prove their point, the authors built two specific examples, like two different versions of a puzzle game.

The First Puzzle: The 12-Vertex World
Imagine a small puzzle with 12 pieces. In this world, the authors found that even though the pieces seem to block each other, there is actually a way to arrange them so that every single piece has a definite "True" or "False" value. It's like a puzzle where, if you look hard enough, you can find a hidden pattern that makes everything fit perfectly. In this world, the uncertainty is just an illusion caused by not knowing the full picture. If you knew the "hidden state" (the secret arrangement of the pieces), you could predict everything with 100% certainty. This shows that sometimes, quantum-like confusion is just a lack of information.

The Second Puzzle: The 140-Vertex World
Now, imagine a much bigger, more complex puzzle with 140 pieces. This one is built from a specific pattern of 24 special points and 24 groups of four (which the authors link to a famous mathematical shape called the Peres configuration). When the authors tried to solve this puzzle by assigning "True" or "False" to every piece, they hit a wall. They proved, using a clever counting trick called a "parity argument," that it is impossible to assign values to all 140 pieces without creating a contradiction. No matter how you try, you will always end up with a situation where a piece must be both True and False at the same time.

This is the paper's big discovery: In this 140-piece world, the uncertainty is real. It's not because you are missing information; it's because the structure of the puzzle itself forbids a complete, sharp answer. There is no "hidden state" that can make everything clear. The uncertainty is built into the very fabric of the logic.

The "Back-Action" Surprise

The authors also looked at what happens when you "measure" something in these worlds. They introduced a rule: if you measure a piece and find it is "True," you update your map to reflect that. They showed that in the 140-vertex world, measuring one thing can instantly mess up your knowledge of another thing. It's like playing a game where checking your score in one category erases your score in another. This is called "back-action." They proved that even in a world built on standard logic, measuring one thing can destroy the sharpness of another, just like in real quantum physics.

Why This Matters

The paper doesn't claim to have solved all of quantum physics or to have built a new quantum computer. Instead, it offers a new way to look at the problem. It suggests that the weirdness of the quantum world might not come from a failure of logic, but from the way the "questions" (or propositions) are connected.

By showing that you can build these "uncertain" worlds using only classical logic, the authors demonstrate that the strange behavior of particles might be a result of how information is organized, rather than a sign that the universe is fundamentally broken. They provide a clear, mathematical map showing exactly where the "hidden variables" (the secret answers) can exist (like in the 12-piece puzzle) and where they are strictly forbidden (like in the 140-piece puzzle). It's a reminder that sometimes, the most confusing things in science aren't magic—they're just puzzles with a very clever design.

Technical Summary: Quantum Uncertainty in a Macroscopic Domain

Problem Statement
The paper addresses the structural tension between classical propositional logic and the non-Boolean nature of quantum propositions. In standard quantum mechanics, the lattice of closed subspaces (or orthogonal projections) of a Hilbert space forms a partial Boolean algebra (pba) rather than a global Boolean algebra; distributivity fails globally, and not all propositions are compatible. While this has historically motivated the development of "quantum logic" as a modification of classical logic, the authors challenge the necessity of abandoning classical deduction. The central problem is to determine whether the phenomena of contextuality and uncertainty (such as the Kochen–Specker obstruction) can be modeled within a framework that retains classical propositional logic, attributing the non-Boolean behavior to the organization of propositions and their compatibility relations rather than to a modification of truth tables or consequence relations.

Methodology
The authors develop a model-theoretic representation of partial Boolean algebras (pbas) using classical propositional logic. The core methodology involves:

Construction of Induced Theories ( $T_g$ ): Given a pba $(V, \Pi)$ and a surjection $g$ from a set of initial formulas $U$ onto $V$ , the authors define a consistent theory $T_g$ . The axioms of $T_g$ are derived directly from the order and orthogonality relations of the pba (e.g., if $g(p) \leq g(q)$ , then $p \to q$ is an axiom; if $g(p) \perp g(q)$ , then $p \to \neg q$ is an axiom).
Characterization of Models via Clusters: The models of $T_g$ are characterized as "upward-closed clusters." A cluster is a subset of initial formulas containing no pair of mutually orthogonal elements. The authors prove that every cluster generates a unique model, and every model is an upward-closed cluster.
The Core of the Theory: The "core" of the theory, defined as the set of equivalence classes of initial formulas, is shown to be isomorphic to the original pba $(V, \Pi)$ . This establishes that any pba can be realized as the core of a consistent classical theory.
Model-Theoretic Formulation of KS-Colourability: The paper redefines the Kochen–Specker (KS) property (KS-colourability) in terms of model existence. A pba is KS-colourable if and only if there exists a model of $T_g$ that intersects every "pre-frame" (a set of primitive formulas mapping to a frame of orthogonal atoms) in exactly one formula. Such models are termed "dispersion-free."
Uncertainty and Dynamics: For finite-spectrum observables, uncertainty is defined combinatorially as the number of locally admissible atomic outcomes (pointer set size minus one). The authors introduce a measurement-update rule where a measurement of an observable $P$ yielding outcome $a$ updates the current model $M$ to the pure-state model generated by the atom corresponding to $a$ .

Key Contributions and Results

Realization of Quantum Logic in Classical Logic: The paper proves that every partial Boolean algebra is isomorphic to the core of a consistent theory formulated entirely in classical propositional logic. The non-Boolean structure is located in the distinguished family of propositions and their compatibility, not in the logic itself.
Equivalence of KS-Property and Dispersion-Free Models: The authors establish a direct equivalence: a pba admits a KS-colouring (a global 0–1 assignment selecting one atom per frame) if and only if the induced classical theory $T_g$ possesses a dispersion-free model. Consequently, the Kochen–Specker obstruction is reinterpreted as the non-existence of a specific type of classical model, even though the ambient deductive system is classical.
Finite-Spectrum Uncertainty and Back-Action: The paper defines a possibilistic notion of uncertainty based on the count of locally admissible outcomes. It demonstrates that in models where the pba is not KS-colourable, no model can make all observables sharp simultaneously. Furthermore, the introduction of a measurement-update rule reveals "back-action": measuring an incompatible observable can destroy the sharpness of a previously sharp observable. This is illustrated in a concrete finite example where a sharp observable becomes uncertain after an incompatible measurement.
Two Finite Examples:
- $V_{12}$ : A 3-dimensional, 12-vertex pba that is KS-colourable. It admits dispersion-free models, meaning its uncertainties can be eliminated by refining to a global valuation (hidden state).
- $V_{140}$ : A rigorously constructed 4-dimensional, 140-vertex pba. The authors prove via a parity argument (using a 3×3 array of modules isomorphic to the Peres 24-ray configuration in $\mathbb{R}^4$ ) that $V_{140}$ is not KS-colourable. Consequently, the induced theory has no dispersion-free model, and no model exists in which every finite-spectrum observable is sharp.
Macroscopic Interpretation: The authors assign macroscopic interpretations (e.g., statements about fictional characters) to the initial formulas in both examples. This demonstrates that the formal phenomena of uncertainty and contextuality arise from the logical organization of propositions and contexts, independent of whether the domain is microscopic (quantum) or macroscopic.

Significance and Claims
The paper claims to provide a "model-theoretic formulation" of quantum-like uncertainty and contextuality without modifying classical logic. Its significance lies in:

Structural Clarification: It separates the non-Boolean nature of quantum propositions from the logic used to reason about them, showing that the obstruction to global truth assignments (KS-property) is a structural feature of the compatibility relations, not a failure of classical deduction.
Finite Combinatorial Proofs: It provides a complete combinatorial construction of a 140-vertex pba that exhibits the Kochen–Specker obstruction, linking it explicitly to the Peres configuration in Hilbert space.
Possibilistic Uncertainty: It offers a definition of uncertainty that does not rely on probability measures, framing it instead as a property of the model's "pointer set" and the admissibility of outcomes.
Modest Scope: The authors explicitly state that their framework represents contextual compatibility patterns but does not currently supply probabilities, resource monotones, or computational speed-ups. They emphasize that while the structures are isomorphic to quantum propositions, the macroscopic interpretations are illustrative and do not by themselves establish a physical violation of probabilistic or temporal inequalities (such as Leggett–Garg inequalities) without further specification of probability laws.

In summary, the paper argues that the "quantum-like" phenomena of uncertainty and contextuality can be understood as the limitations of classical models when constrained by specific compatibility structures, rather than as evidence for a non-classical logic.