Pith. sign in

REVIEW 2 major objections 3 minor 17 references

Quantum uncertainty in a macroscopic domain

T0 review · 2 major / 3 minor · reviewed 2026-08-11 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read Every partial Boolean algebra is the core of a consistent classical propositional theory.

desk verdict Solid core theorem, but the flagship V140 example has an unverified transitivity claim that needs fixing before I'd trust it. read the letter →

arxiv 2608.09262 v1 pith:YEG73HBV submitted 2026-08-10 quant-ph math-phmath.MP

Othman Q. Malhas , Bacim Alali This is my paper · ORCID
classification quant-phmath-phmath.MP MSC 03G1281P1003B0506C15
keywords partialBooleanalgebraKochen-Speckertheoremclassicalpropositionallogicdispersion-freemodelcontextualityuncertaintyLindenbaumPeresconfiguration
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper aims to show that quantum-like uncertainty and Kochen-Specker contextuality can be reproduced inside ordinary classical propositional logic, without changing truth tables, deduction, or the consequence relation. The method is constructive: given any partial Boolean algebra and a surjection of atomic formulas onto its vertices, the axioms of the induced theory are chosen so that the theory's core—the equivalence classes of those atomic formulas—is isomorphic to the original partial Boolean algebra. The paper then proves that models of this theory are exactly upward-closed clusters, that KS-colourability is equivalent to the existence of a dispersion-free model, and that a constructed 140-vertex example has no such model, by a parity argument. A concrete measurement-update postulate shows that measuring an incompatible observable can destroy sharpness. The conclusion is that nonclassicality is located in the organization of propositions and models, not in nonclassical deduction.

What carries the argument

The core of a theory is the central object: the subset of the Lindenbaum algebra consisting of equivalence classes of initial formulas. A cluster is a set of initial formulas containing no orthogonal pair; every cluster extends by upward closure to a model, and every model is such an extension. Pre-frames are preimages of frames, and a dispersion-free model is one that meets every pre-frame in exactly one primitive formula. The carrying identity is the isomorphism f([p])=g(p), which transfers KS-colourability into the existence of a dispersion-free model. The non-colourable example V_140 is built from a 3×3 array of modules whose quotient by side-complement congruence has 140 vertices and 24 maximal Boolean components; the parity count over nine loops forbids a KS-colouring.

What would settle it

An independent exhaustive check of the side list (Σ) would settle the central claim: build the compatibility graph on the 140 congruence classes and enumerate its maximal cliques; if any maximal clique is not exactly one of the 24 sixteen-element side components, or if an exhaustive search over all $2^{24}$ assignments finds a function that assigns exactly one 1 to every side, then Theorem 16.7 and Corollary 16.8 fail.

Watch

Extended reading notes

Core claim

The central discovery is Theorem 6.12: for any partial Boolean algebra (V,Π) and any surjection g from the initial formulas of a propositional language onto V, the induced theory T_g is consistent and its core C(T_g)—the set of equivalence classes of initial formulas modulo provable equivalence—carries a unique partial Boolean algebra structure on which the map f([p])=g(p) is an isomorphism onto (V,Π). Equivalently, every partial Boolean algebra, including the propositional structure of a finite-dimensional Hilbert space, is the core of an ordinary classical propositional theory. Building on this, the paper characterizes models as upward-closed clusters, proves that a nontrivial n-dimensional partial Boolean algebra is KS-colourable exactly when the induced theory has a model meeting every pre-frame in exactly one primitive formula, and exhibits a 140-vertex four-dimensional partial Boolean algebra with no such model; the obstruction is a parity argument over nine loops, and the incidence structure is isomorphic to the Peres 24-ray configuration in $R^{4}$. Consequently, every model of the corresponding theory fails to make every finite-spectrum observable sharp (Corollary 16.8).

Load-bearing premise

The V_140 example depends on the finite combinatorial claim that every pairwise compatible family of vertices lies in one of the 24 side components; the paper says an exhaustive maximal-clique enumeration certifies this, but the verification code is not included.

Editorial extensions

If this is right

  • Every finite-dimensional partial Boolean algebra, hence the quantum propositional structure of any finite-dimensional Hilbert space, is the core of a consistent classical propositional theory.
  • A partial Boolean algebra is KS-colourable if and only if its induced theory has a dispersion-free model, so the Kochen-Specker obstruction appears as the nonexistence of a certain kind of classical model rather than a breakdown of classical logic.
  • If every finite-spectrum observable is sharp in a model, the underlying algebra must be KS-colourable; consequently the V_140 theory has no model in which every observable is sharp.
  • With the measurement-update postulate, measuring an incompatible observable can turn a sharp observable into a nonsharp one, giving a finite, logic-level description of back-action.
  • Because V_140's incidence structure is isomorphic to the Peres configuration, the same core is realized by genuine quantum propositions in dimension four.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The model space of T_g is finite for finite V, so the update rule defines a finite transition system on models; the paper does not explore its reachable states, fixed points, or recurrent classes, but those could be analyzed without adding probabilities.
  • The definition of uncertainty as a count of locally admissible outcomes is possibilistic; pairing it with a probability law on globally admissible outcomes would be the natural next step toward meaningful temporal inequalities, which the paper explicitly leaves open.
  • The same logical transport should apply to any parity-based Kochen-Specker proof, not only the Peres/Cabello one: any finite ray configuration with a parity argument yields a classical propositional theory with no dispersion-free model.
  • Many models of T_g are neither pure-state nor support-state certainty models, so the framework may encode more than state certainty; what, if anything, those extra models represent operationally is a question the paper does not settle.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

2 major / 3 minor

Summary. This paper develops a classical model-theoretic representation of partial Boolean algebras (pbas). For a surjection g from the set of initial formulas of a propositional language onto a pba (V,Π), the authors define a theory T_g via the axioms (g1)–(g4) encoding order and orthogonality of V, prove its consistency, characterize all models as upward-closed clusters (Theorems 6.6–6.9), and prove the central Theorem 6.12: the core of T_g — the ordered set of equivalence classes of initial formulas — carries a unique pba structure isomorphic to (V,Π). They then give a model-theoretic reformulation of KS-colourability (Theorem 10.6), introduce finite-spectrum observables with a possibilistic uncertainty measure based on pointer sets and locally admissible outcomes (Sections 11–13), a measurement-update rule yielding repeatability and a finite back-action example in the 12-vertex algebra V12 (Section 14), and a dispersion-free criterion equivalent to KS-colourability and to two-valued homomorphisms (Theorems 15.3–15.4). The main negative example is the 140-vertex algebra V140, built from a 3×3 array of modules by side-complement word congruence, claimed to be a four-dimensional pba (Theorem 16.5), shown not KS-colourable by a parity argument over nine loops (Theorem 16.7), with incidence structure isomorphic to the Peres 24-ray configuration.

Significance. Assuming the construction of V140 is fully validated, this is a substantial contribution. It shows that the structure usually associated with quantum contextuality, namely the Kochen–Specker obstruction, can be expressed as a property of the models of an ordinary classical propositional theory, with no modification of deduction, and the paper says precisely what it does and does not claim: no probabilities, no Leggett–Garg inequality, no resource monotone, and no computational speed-up. The proofs I checked in detail — Theorems 6.6, 6.12, 10.6, 15.3, and 16.7 — appear correct, and the cluster characterization of models is a clean and potentially reusable technique. The general framework rests on the stated axioms (P1)–(P6), and the measurement-update rule is honestly declared a postulate in Section 14. However, the flagship example currently rests on an incomplete verification of one load-bearing property, axiom (P6) for V140: the finite certificate described in Appendix C does not cover transitivity or antisymmetry of the global order, and the verification code is not shipped. This must be fixed before the central claims can be relied upon.

major comments (2)
  1. [16.2, Theorem 16.5] The proof of axiom (P6) for (V140, Π140) is not supplied. Theorem 16.5 says that 'well-definedness and transitivity follow from Proposition 16.4 and the common-component property', but the common-component property (Lemma 16.2(7)) can be invoked only for a family already known to be pairwise compatible. From [[u]] ≤ [[v]] and [[v]] ≤ [[w]] one obtains compatible pairs {u,v} and {v,w}, not the pair {u,w}; compatibility is not transitive, as Remark 4.5 itself warns. No argument in Section 16.2 produces a single side containing representatives of [[u]] and [[w]], so transitivity of the global order is asserted rather than proved. Antisymmetry is also not addressed explicitly, although it appears to follow from the fact that congruence preserves word size. The nine verification steps of Appendix C check congruence, representative-independence, component intersections, maximal cliques, parity, exhaustive KS-search, and the Peres isomorphism, but they do not include a check of transitivity or antisymmetry of ≤. This is load-bearing: Theorem 6.12, Theorem 15.4, Theorem 15.3, and Corollary 16.8 all presuppose that V140 is a pba; if the global order is not a partial order, Corollary 16.8 collapses. Because the condition is finite and checkable on 140 vertices, I request either a structural proof of transitivity or an explicit, reported verification step (with the certificate), to be added to Appendix C.
  2. [Appendix C; Declarations (Code availability)] The certificate for the paper's central example is not independently reproducible from the manuscript. Appendix C describes nine verification steps and states that a short Python program confirms them, but also that the code is 'available from the authors on request'; the Declarations repeat this. Since Lemma 16.2(7) (maximal-clique enumeration of the 140-vertex compatibility graph) and the missing order-theoretic checks of Theorem 16.5 are finite computational facts that the paper does not prove by hand, the validity of the non-KS example currently depends on an unshipped program. The accompanying assertion that every step 'can equally be carried out by hand from the side list (Σ)' is not credible at this scale. I recommend shipping the code as supplementary material or providing a machine-checkable certificate, and adding the transitivity and antisymmetry checks for ≤ to the enumerated list in Appendix C.
minor comments (3)
  1. [7.1] The sentence 'g(p2) ⊓ g(p8) = g(p7)' uses the partial operation ⊓ for vertices 2 and 8, which are incompatible in (V12, Π◦) by Proposition 5.1; by Definition 4.3 and Proposition 4.2, the meet is defined only for compatible pairs. The computation is correct as a meet in the underlying orthomodular lattice of Figure 1, but the text does not say so, and the example conflates the ambient lattice meet with the partial pba operation.
  2. [13, Definition 13.1] Definition 13.1 defines the pointer set ΔM(P) but only Remark 13.2 notes that (P, ΔM(P)) need not itself be true in M; since this is an easy inference to draw incorrectly, the warning belongs in or immediately after the definition, not in a later remark.
  3. [13.2; 15.1] The counts for T12 (53 models, 5 dispersion-free, 18 making both P0 and Q0 sharp, 11 leaving one observable non-actualizable) are asserted in Remark 13.2 and after Proposition 15.2 and are said to be reproduced by the unshipped program; adding a short table or counting derivation would make these numeric claims verifiable independently of the code.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the core representation and the V140 parity obstruction are self-contained; self-citations are programmatic and not load-bearing.

full rationale

The paper's central derivation chain is self-contained rather than circular. Theorem 6.12 is a representation theorem: given any partial Boolean algebra (V,Π) and a surjection g, the axioms (g1)–(g4) are explicitly defined from the order and orthogonality of V, and the proof shows directly that the core C(T_g) is isomorphic to (V,Π). This is a construction whose conclusion equals its premise by design, but the paper does not disguise that fact as an independent prediction; it states openly that every partial Boolean algebra arises as the core of a theory of the form T_g. The isomorphism proof uses only the axioms and the cluster machinery, not any external result. Likewise, the Kochen–Specker reformulation in Theorem 10.6 is an equivalence, proved in both directions from the definitions of pre-frame, cluster, and model; it is a translation, not a circular derivation. The V140 obstruction is supported by a concrete parity argument in Theorem 16.7 that counts incidences in nine loops, independent of the model-theoretic apparatus, and the Hilbert-space realization in Remark 16.10 is explicitly attributed to the Peres configuration rather than being derived from the theory. The self-citations to Malhas's earlier work [10,11,13,14] are programmatic and historical; the axiom scheme is restated in full in Section 6.1, so the cited papers are not needed to justify any load-bearing step. The paper is also careful about its own limits: Section 16.4 and Section 17 explicitly disclaim Leggett–Garg predictions, probability rules, and resource claims, and Appendix C presents finite verification as reproducible support rather than as a substitute for proof. The terse treatment of axiom (P6) in Theorem 16.5 is a prospective correctness or proof-completeness concern, not a circularity concern, because no step reduces by construction to its own input. Overall, there is no significant circularity in the claimed derivation chain.

Assumptions & free parameters 0 free parameters · 4 assumptions · 0 invented entities

The paper introduces no fitted parameters and no new physical entities. The central construction rests on the stated definition of partial Boolean algebra and on classical logic; the measurement-update rule is an explicit additional postulate. The main gap is the reliance on a described-but-unshipped finite computation for Lemma 16.2(7).

assumptions (4)
  • standard math Classical propositional logic with standard truth tables
    The entire framework uses ordinary propositional logic and valuations; all consistency and model notions are standard.
  • domain assumption Partial Boolean algebra axioms (P1)-(P6), including the strong compatibility condition (P5) and global partial order (P6)
    The representation theorem applies only to structures satisfying these axioms; the Hilbert-space propositional structure is asserted to satisfy them via [16].
  • ad hoc to paper Measurement-update rule of Section 14 (the updated model is the pure-state model based on the observed atom)
    Explicitly introduced as a postulate to define dynamics; not a consequence of the preceding logic.
  • domain assumption Lemma 16.2(7): every finite pairwise compatible family of vertices of V140 lies in one of the 24 side components, certified by exhaustive enumeration
    This finite combinatorial fact is load-bearing for V140 being a partial Boolean algebra; its proof in the text is delegated to a described but unshipped computation.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Quantum uncertainty in a macroscopic domain." pith.science (2026). https://pith.science/paper/YEG73HBV

@misc{pith2026260809262,
  author       = {Pith},
  title        = {Pith review of: Quantum uncertainty in a macroscopic domain},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/YEG73HBV}},
  note         = {Machine review of arXiv:2608.09262}
}
abstract

We develop a classical model-theoretic representation of partial Boolean algebras and use it to formulate quantum-like uncertainty without abandoning classical propositional logic. Given a surjection from the initial formul\ae\ of a propositional language onto a partial Boolean algebra $(\mathcal V,\Pi)$, we construct a consistent theory $\mathcal T_g$ whose core---the ordered set of equivalence classes of initial formul\ae---is isomorphic to $(\mathcal V,\Pi)$. Its models are characterized as upward-closed clusters, yielding a model-theoretic formulation of KS-colourability: an $n$-dimensional partial Boolean algebra is KS-colourable exactly when the induced theory has a model meeting every pre-frame in one primitive formula. For finite-spectrum observables, uncertainty is defined by the number of locally admissible atomic outcomes. Dispersion-free models are characterized by the singleton pre-frame condition. With an additional measurement-update postulate, a finite example shows how measurement of an incompatible observable can destroy sharpness, providing a model-theoretic form of back-action. A $12$-vertex partial Boolean algebra is KS-colourable, whereas a rigorously constructed $140$-vertex, four-dimensional partial Boolean algebra is not, as shown by a parity argument; its incidence structure is isomorphic to the Peres $24$-ray, $24$-basis configuration in $\mathbb R^4$. Macroscopic interpretations show that these phenomena arise from the organization of propositions and models rather than from nonclassical deduction. Finally, we relate certain models to the probability-one propositions of pure states and density operators, while emphasizing that such certainty models do not determine the full quantum state.

Figures

Figures reproduced from arXiv: 2608.09262 by the authors.

Figure 1
Figure 1. The Hasse diagram V12, shown on the left, is an orthocomplemented lattice obtained by gluing the Boolean algebras B1 and B2 along their common Boolean subalgebra {0, 1, 6, 7}. With the component family specified in (3), it is also a partial Boolean algebra. 5 A simple nontrivial example of a partial Boolean algebra For a finite-dimensional Hilbert space, the quantum propositions may be represented by its linear subs… view at source ↗
Figure 2
Figure 2. The two maximal Boolean components of V12. They are glued along the common Boolean subalgebra {0, 1, 6, 7}; orthocomplementation is given by (2). Definition 5.2. An isomorphism h : (V1, Π1) → (V2, Π2) of partial Boolean algebras is a bijection h : V1 → V2 such that B ∈ Π1 ⇐⇒ h(B) ∈ Π2, and, for every component B ∈ Π1, the restriction h|B is a Boolean-algebra isomorphism onto h(B). 6 The theory induced by g : U ↠ V L… view at source ↗
Figure 3
Figure 3. A schematic representation of models and pre-frames. The set U of initial formulæ is depicted as a disc, the chords represent pre-frames, and the solid discs represent models. A model meets each pre-frame in at most one point, i.e. in at most one initial formula (Lemma 10.4). Lemma 10.5. Let f be a KS-function. For every pre-frame F let aF be the unique primitive formula in F with f [PITH_FULL_IMAGE:figures/full_fi… view at source ↗
Figures from the paper (3 more)
Figure 4
Figure 4. Figure 4: Let Λ = {A, B, . . . , R, U, V, W, X, Y, Z} be the set of the twenty-four letters of the alphabet other than S and T. We use the following six column sides: L1 = {A, B, C, U}, R1 = {J, K, L, X}, L2 = {D, E, F, V }, R2 = {M, N, O, Y }, L3 = {G, H, I, W}, R3 = {P, Q, R, …
Figure 4
Figure 4. Figure 4: A module and its four sides. For 1 ≤ i, j ≤ 3, the module mij has left side Li , right side Rj , and the two loop sides listed below: top loop bottom loop m11 {A, J, K, B} {C, L, X, U} m12 {A, M, N, C} {B, O, Y, U} m13 {B, P, Q, C} {A, R, Z, U} m21 {D, J, L, E} {F, K, …
Figure 5
Figure 5. Figure 5: The configuration Σ, a 3 × 3 array of modules mij . 32 [PITH_FULL_IMAGE:figures/full_fig_p032_5.png]

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

17 extracted references · 16 canonical work pages

  1. [1]

    Enderton , title =

    Herbert B. Enderton , title =

  2. [2]

    C. C. Chang and H. J. Keisler , title =

    work page

  3. [3]

    International Journal of Theoretical Physics , volume=

    Quantum theory as a theory in a classical propositional calculus , author=. International Journal of Theoretical Physics , volume=. 1992 , publisher=

    work page 1992

  4. [4]

    V. S. Varadarajan , title =

    work page

  5. [5]

    Duke Mathematical Journal , volume =

    Zierler, Neal and Schlessinger, Murray , title =. Duke Mathematical Journal , volume =. 1965 , pages =

    work page 1965

  6. [6]

    , title =

    Malhas, Othman Q. , title =. The Journal of Symbolic Logic , volume =

    work page

  7. [7]

    , title =

    Malhas, Othman Q. , title =. International Journal of Theoretical Physics , volume =

    work page

  8. [8]

    , title =

    Kochen, Simon and Specker, Ernst P. , title =. Journal of Mathematics and Mechanics , volume =. 1967 , pages =

    work page 1967

Show all 17 references
  1. [9]

    Kalmbach, Gudrun , title =

  2. [10]

    Reviews of Modern Physics , volume =

    Cabello, Ad\'an and Severini, Simone and Winter, Andreas , title =. Reviews of Modern Physics , volume =

  3. [11]

    Foundations of Physics , volume =

    Spekkens, Robert , title =. Foundations of Physics , volume =

  4. [12]

    Physical Review Letters , volume =

    Leggett, Anthony and Garg, Anupam , title =. Physical Review Letters , volume =

  5. [13]

    , title =

    Gleason, Andrew M. , title =. Journal of Mathematics and Mechanics , volume =

  6. [14]

    , title =

    Copi, Irving M. , title =

  7. [15]

    Journal of Physics A: Mathematical and General , volume =

    Peres, Asher , title =. Journal of Physics A: Mathematical and General , volume =

  8. [16]

    and Garc\'ia-Alcaine, Guillermo , title =

    Cabello, Ad\'an and Estebaranz, Jos\'e M. and Garc\'ia-Alcaine, Guillermo , title =. Physics Letters A , volume =

  9. [17]

    Nature , volume =

    Howard, Mark and Wallman, Joel and Veitch, Victor and Emerson, Joseph , title =. Nature , volume =

Pith tools

Reviewed August 11, 2026 · model on record in the stance chip above.