Does the Symbolic LM Calculus Canonically Induce
the Modal Measurement Theory?
Adversarial bridge analysis between formula-valued Logical Matrices and the later
chain-ring modal/effect framework
Research synthesis and independent finite verification
18 September 2026
Abstract
This report asks whether the formula-valued Logical Matrix (LM) calculus developed in
Operator-Level Boolean Computation with Correspondence Matrices can be regarded as the
canonical symbolic source of the later modal measurement theory over the finite chain ring
A ∼= F [u]/(u4). The answer is mixed but mathematically useful. Paper B already proves
2
that Boolean valuation commutes with LM pairing. That fact extends naturally to arbitrary
matrix, module, and tensor expressions after an explicit scalar enrichment. However, direct
Boolean valuation cannot produce the nilpotent and unit amplitudes of the chain ring: every
Boolean-ring homomorphism into the local ring A lands in its idempotents {0,1}. The correct
positive bridge is therefore not direct valuation but scalar enrichment B ⊗F A, followed by
2
valuation specialization v ⊗ Id . In this enriched calculus, each symbolic amplitude has a
A
canonicalBooleansupportpredicatewhosesatisfyingvaluationsareexactlythoseforwhichthe
corresponding concrete ring-valued modal amplitude is nonzero. This yields a precise symbolic-
support theorem connecting formula semantics to modal possibility.
Thereportalsoprovesnegativeboundaries. Thelaterrulesthateffectsarerowsofreversible
A-bases and that a nonzero contraction denotes a possible event are additional measurement
structure,notconsequencesofthePaper-BLMsemantics. TheoriginalLMstateencodinggen-
erates only coordinate effects under valuation and therefore does not generate the complete 192
reversible projective two-outcome basis family. A division-free branch update JB = B−1P B
i i
is nevertheless available for every reversible modal basis and is compatible with projective unit
rescalingandvaluation. Zerodivisorsstillobstructaclosedunrestrictedprocesstheory: nonzero
statesneednotbetensor-closed, andconditioningcantakeunimodularpreparationstononuni-
modular conditional states.
Independentexhaustivechecksreproducethe16-elementchainring,its8unitsand2idempo-
tents, |GL (A)|=24576, the 192 unordered projective reversible bases, 98,304 branch-support
2
checks,262,144symbolic-supportfiberchecks,andthefailureof144outof256ordinaryBoolean-
ring matrix products to remain inside the restricted 16-element Paper-B LM family.
Contents
1 Research question and verdict 3
1.1 Executive verdict . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3
2 Primary sources and methodological boundary 3
3 Strict type map 4
1

4 Q1: What is a formula-valued LM mathematically? 5
5 Q2: What is LM pairing mathematically? 6
6 Q3: Valuation naturality 7
7 A decisive negative theorem: direct valuation cannot produce chain-ring ampli-
tudes 7
8 The CM-to-chain-ring identification is linear before it is multiplicative 8
9 The correct positive bridge: scalar enrichment 9
10 The strongest bridge theorem:
symbolic support realizes modal possibility 9
11 Q4: Can formula-valued LMs represent modal effects? 11
11.1 As measurement semantics: only a restricted subset . . . . . . . . . . . . . . . . . . 11
11.2 As coefficient data: every effect can be encoded after choices . . . . . . . . . . . . . 11
12 Q5: “nonzero = possible” is extra structure 12
13 Q6: Symbolic observables/effects 12
14 Q7: Sequential measurement and update 13
14.1 Projective well-definedness . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 14
14.2 Symbolic update . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 14
15 Why this is not yet a closed process theory 14
15.1 Nonzero states are not tensor-closed . . . . . . . . . . . . . . . . . . . . . . . . . . . 14
15.2 Unimodular preparation is not conditioning-closed . . . . . . . . . . . . . . . . . . . 14
16 Failure results and exact boundaries 15
17 Prior-art matrix 15
18 Adversarial interpretation 17
18.1 What is routine . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 17
18.2 What is genuinely informative in the synthesis . . . . . . . . . . . . . . . . . . . . . 17
19 Computational verification 17
20 Paper implications 18
21 Strongest defensible theorem and final answer 19
A Reproducibility notes 19
B Search strategy 19
2

1 Research question and verdict
The central question is whether the schematic chain
formula-valued LM −→ Boolean valuation −→ CM/coefficient representation
−→ state/resource −→ effect/measurement −→ logical or modal outcome
is a genuine mathematical semantics, rather than a collection of later constructions sharing matrix
notation.
1.1 Executive verdict
There is a genuine bridge, but the later modal measurement theory is not canonically derivable
from Paper B as it currently stands.
The strongest defensible formulation is:
Paper B canonically supplies a symbolic Boolean layer and a valuation-natural con-
traction calculus. After independently choosing the chain-ring amplitude algebra A,
there is a natural scalar-enriched symbolic extension in which valuation continues to
commute with states, effects, contractions, matrix operations, and tensor products. In
that extension, every ring-valued amplitude has a canonical Boolean support predicate
describing exactly the valuations for which the corresponding modal event is nonzero.
However, the rules that effects are rows of reversible A-bases and that nonzero means
possible are extra measurement structure. They are not consequences of the original
formula-valued LM calculus.
Thus the clean architecture is
Boolean symbolic LM calculus −→ A-enriched symbolic calculus
val − u → ation A-valued states/effects suppor − t → contract modal outcomes.
The missing structure consists of at least three independent ingredients:
(1) a chosen cyclic/chain-ring multiplication on the four CM coefficients;
(2) a chosen admissible measurement family, such as rows of matrices in GL (A);
n
(3) the support interpretation a ̸= 0 ⇐⇒ “possible.”
2 Primary sources and methodological boundary
The analysis treated the manuscript Operator-Level Boolean Computation with Correspondence
Matrices (“Paper B”) as background rather than rediscovering its results. The primary Paper-B
text read for this investigation includes Section 8.1–8.2 and its proof appendix. In the parsed copy
used for the review, lines 560–669 define the Boolean algebra of formulas modulo equivalence, the
formula-valued LM, positive and general valuation, logical pairing, Proposition 2, and Theorem 3.
Lines 780–874 contain the appendix proof and finite verification scope.
The later modal source read was PURE_BOOLEAN_MODAL_CM_ADDENDUM.tex. In the parsed copy
used for the review, lines 45–118 explicitly state that the modal nonzero-support readout is an
“additionalcontract,” introducethechainring, definestatesandseparability, andspecifyreversible
3

effect bases. Lines 440–539 contain the complete 192-basis support classification, and lines 620–643
identify the remaining multi-round measurement/update problem.
The supplied adversarial-review archive is included verbatim and unpacked in this research
package. It contains the earlier novelty dossier, theorem candidates, search logs, source-audit files,
and a large set of reproduced computational outputs. The current report adds a separate bridge
analysis and fresh independent checks.
3 Strict type map
The investigation keeps the following object types separate.
Layer Object Map Status / preserved
structure
Binary truth C ∈ M (F ) C 7→ LM (C) Injective for freely
2 2 X,Y
function assignable X,Y;
preserves XOR and
entrywise Boolean op-
erations; not ordinary
matrix multiplication.
Formula-valued LM (C) ∈ M (B) entrywise Boolean val- Canonical for each
X,Y 2
LM uation v valuation; preserves
Boolean-ring opera-
tions.
Valued CM v(LM) ∈ M (F ) vectorization Linear bijection after
2 2
cell-order choice; ba-
sis/order dependent.
Four coefficients c ∈ F4 cyclic-basis identifica- Vector-space bijection
2
tion to A; does not inherit
ordinary 2 × 2 matrix
multiplication.
Chain-ring scalar a ∈ A ∼= F [u]/(u4) regular representation Injective algebra
2
Λ representation into
M (F ) after mul-
4 2
tiplication on A is
chosen.
One-system state ψ ∈ An effect application Free A-module object;
one CM is only one
scalar of A, not a
whole state.
Bipartite re- M ∈ M (A) M 7→ UMVT Local A-linear action;
m,n
source distinct type from
original Boolean CMs.
4

Layer Object Map Status / preserved
structure
Effect e ∈ (An)∗ =∼ A1×n e(ψ) = eψ A-linear functional;
row identification uses
a free-module basis.
Measurement rows of B ∈ GL (A) Bψ Reversible coordinate
n
change; additional
modal choice.
Outcome scalar eψ ∈ A or eMfT ∈ A a 7→ [a ̸= 0] Support zero-test; not
a ring/semiring homo-
morphism in general.
Symbolic en- S
A
= B⊗F
2
A v
A
= v⊗Id
A
Canonical once A is
riched layer chosen; preserves ring,
module, matrix, and
tensor operations.
Symbolic modal q ∈ S Supp (q) ∈ B Exact valuation-wise
A A
outcome zero/nonzero seman-
tics; support itself
is not an algebra
homomorphism.
A key typing correction is
one 2×2 Boolean CM ̸= one modal state.
After a four-feature basis is chosen, one CM becomes one scalar of A. A one-bit modal state needs
two such scalars:
ψ = a |0⟩+a |1⟩ ∈ A2.
0 1
A two-party resource requires four such scalars.
4 Q1: What is a formula-valued LM mathematically?
Let B be the Lindenbaum Boolean algebra of propositional formulas modulo logical equivalence.
Write it as a Boolean ring using
f +g = f ⊕g, fg = f ∧g, ¬f = 1+f.
For freely assignable symbols X,Y, define
X = X, X = ¬X, Y = Y, Y = ¬Y.
1 2 1 2
For a binary truth table C = (c ) ∈ M (F ), Paper B defines
ij 2 2
LM (C) = M c |X ⟩⟨Y | ∈ M (B).
X,Y ij i j 2
i,j
5

Equivalently, after expansion,
!
XΘY XΘ¬Y
LM (Θ) = .
X,Y ¬XΘY ¬XΘ¬Y
Theorem 4.1 (Algebraic status of the Paper-B LM family). For fixed freely assignable X,Y, the
map
ℓ : M (F ) −→ M (B), C 7−→ LM (C),
X,Y 2 2 coeff 2 X,Y
is injective and F -linear. It preserves entrywise Boolean operations. It is not, in general, a homo-
2
morphism from ordinary Boolean-ring matrix multiplication on M (F ) to matrix multiplication in
2 2
M (B).
2
Proof. Linearity follows from the XOR sum defining the LM. Positive valuation sends the LM back
toitscoefficientCM,soequalityoftwoLMsimpliesequalityoftheircoefficientmatrices. Therefore
the map is injective. Entrywise Boolean operations commute with the substitution producing the
four polarity positions. Ordinary matrix product is different: multiplication mixes row/column
positions by XOR–AND contraction. Exhaustive evaluation of all 162 = 256 products of the 16
Paper-B LMs shows that 144 products leave the restricted 16-element LM family, so the family is
not closed under this multiplication.
Remark 4.2. The most economical description is therefore: a Paper-B LM is a special predicate-
valued matrix over a free/Lindenbaum Boolean ring. The ambient space M (B) is natural; the 16
2
matrices generated by binary truth functions are a distinguished subset/subalgebra only for the
entrywiseBooleanoperations. CallingtheconstructionmerelyarelationwouldlosetheXOR–AND
scalar algebra used by Paper B.
5 Q2: What is LM pairing mathematically?
For a formula F ∈ B, Paper B defines
!
F
s(F) = , s(F)T = (F,¬F).
¬F
The symbolic pairing is
P (L ,L ) = s(L )T LM (C)s(L ),
C 1 2 1 X,Y 2
where scalar multiplication is conjunction and scalar addition is XOR.
Proposition 5.1 (LM pairing is Boolean-ring matrix contraction). For the special LM associated
with a binary connective Θ,
⟨L |LM (Θ)|L ⟩ ≡ (L ↔ X) Θ (Y ↔ L ).
1 X,Y 2 1 2
Thus the Paper-B “logical pairing” is ordinary matrix contraction over the Boolean ring B, with a
non-linear special state embedding F 7→ (F,¬F).
The roles of the connectives are exact:
• AND is scalar multiplication;
• XOR is scalar addition and reduction;
6

• negation appears in the complement-paired state encoding;
• OR is not the matrix-addition operation used by the pairing.
The pairing may be described semantically as predicate evaluation or relationship extraction,
but those descriptions do not add algebraic structure beyond the Boolean-ring contraction.
6 Q3: Valuation naturality
Let
v : B −→ F
2
be a Boolean valuation. Extend v entrywise to matrices and vectors.
Theorem 6.1 (Valuation naturality). For compatible Boolean-ring matrices and vectors,
v(MN) = v(M)v(N),
and
v(xTMy) = v(x)T v(M)v(y).
The same statement holds for finite Kronecker tensor products.
Proof. EveryoutputentryisafiniteexpressionbuiltfromBoolean-ringadditionandmultiplication.
A Boolean valuation is a homomorphism for those operations, so it may be moved through each
finite sum and product.
This theorem is already present in Paper B for the LM pairing case. Its broader matrix/tensor
version is a routine homomorphism-extension fact. It is useful for organizing the bridge, but it
should not be presented as deep novelty.
7 A decisive negative theorem: direct valuation cannot produce
chain-ring amplitudes
The strongest possible bridge would send Boolean formulas directly into the later amplitude ring
A = F [u]/(u4).
2
That is impossible except for the embedded Boolean scalars.
Theorem 7.1 (Idempotent obstruction). Let B be a Boolean ring and let h : B → A be a unital
ring homomorphism. Then every h(b) is idempotent. In the local chain ring A = F [u]/(u4), the
2
only idempotents are 0 and 1. Therefore
imh ⊆ {0,1} =∼ F ,
2
and h factors through an ordinary Boolean valuation
B −→ F ,→ A.
2
7

Proof. Every element of a Boolean ring satisfies b2 = b. Hence
h(b)2 = h(b2) = h(b).
A local ring has no idempotents other than 0 and 1. The stated chain ring is local, so the image is
Boolean.
Corollary 7.2. Nilpotent and nontrivial unit amplitudes such as
u, u2, u3, 1+u
can never arise as direct values of Paper-B Boolean formulas under a ring-homomorphic valuation.
This rules out the claim that the chain-ring amplitude theory is obtained by simply changing
the codomain of Paper-B valuation.
8 The CM-to-chain-ring identification is linear before it is multi-
plicative
There is a natural-looking sequence
M (F ) − v − e − c →κ F4 − α −→β A,
2 2 2
where κ fixes a cell order and β fixes an ordered F -basis of A. Both arrows are vector-space
2
bijections.
They are not an identification of ordinary 2 × 2 matrix multiplication with the chain-ring
multiplication. Two immediate invariants separate the algebras:
• M (F ) is noncommutative, while A is commutative;
2 2
• |GL (F )| = 6, while A has 8 units.
2 2
Therefore the later cyclic product
E ⋆E = E
r s r+smod4
is additional algebraic structure placed on the four-component coefficient space. Once supplied,
A ∼= F [C ] ∼= F [u]/(u4),
2 4 2
and its regular representation
Λ : A ,→ M (F )
4 2
is an injective algebra homomorphism. The multiplication itself, however, is not forced by the
original LM valuation theorem.
8

9 The correct positive bridge: scalar enrichment
The direct-valuation obstruction suggests the right construction.
Definition 9.1 (Enriched symbolic scalar algebra). Let
S
A
= B⊗F
2
A.
For the current chain ring,
S ∼= B[u]/(u4).
A
Theorem 9.2 (CanonicalspecializationafterchoosingA). ForeveryBooleanvaluationv : B → F ,
2
there is a canonical A-algebra specialization
v = v⊗Id : S → A,
A A A
defined on pure tensors by
v (f ⊗a) = v(f)a.
A
It preserves addition and multiplication and therefore extends entrywise to matrices, vectors, con-
tractions, and tensor products. In particular,
v (eψ) = v (e)v (ψ),
A A A
and
v (EMFT) = v (E)v (M)v (F)T.
A A A A
Remark 9.3 (Universal property). The tensor product is the coproduct of the commutative F -
2
algebras B and A. Therefore this is a genuine universal property, but it is a universal propertyafter
the amplitude algebra A has been independently selected. It does not derive A from the formula
calculus.
For finitely many Boolean generators, if
Ω = Hom (B,2)
Bool
is the valuation set, then extensionally
B ∼= FΩ and hence S ∼= AΩ.
2 A
SoanenrichedsymbolicscalarmaybereadsimplyasanA-valuedfunctionoftheBooleanvaluation.
This is the finite Boolean-power viewpoint.
10 The strongest bridge theorem:
symbolic support realizes modal possibility
Let
q ∈ S ∼= AΩ.
A
Define the symbolic support predicate Supp (q) ∈ B to have exactly the valuation set
A
{v ∈ Ω : v (q) ̸= 0}.
A
9

For
q = f +f u+f u2+f u3, f ∈ B,
0 1 2 3 i
one may write
Supp (q) = f ∨f ∨f ∨f .
A 0 1 2 3
Although this coordinate formula uses the displayed basis, the resulting Boolean predicate is basis-
independent up to logical equivalence because it is defined by the intrinsic condition v (q) ̸= 0.
A
Theorem 10.1 (Symbolic-support bridge). Let
e ∈ S1×n, ψ ∈ Sn.
A A
Define
Poss(e,ψ) = Supp (eψ) ∈ B.
A
Then for every Boolean valuation v,
v (cid:0) Poss(e,ψ)(cid:1) = 1 ⇐⇒ v (e)v (ψ) ̸= 0.
A A
For a bipartite symbolic resource M,
(cid:16) (cid:17)
v Supp (eMfT) = 1 ⇐⇒ v (e)v (M)v (f)T ̸= 0.
A A A A
Proof. Choose an F -basis {β } of A and write the symbolic scalar contraction as
2 k
q = X f β .
k k
k
At valuation v,
v (q) = X v(f )β .
A k k
k
Linear independence of the basis gives
v (q) = 0 ⇐⇒ v(f ) = 0 for all k.
A k
Therefore
!
v (q) ̸= 0 ⇐⇒ _ v(f ) = 1 ⇐⇒ v _ f = 1.
A k k
k k
Corollary 10.2 (Satisfiability/possibility bridge).
Supp (eψ) is satisfiable ⇐⇒ ∃v : v (e)v (ψ) ̸= 0.
A A A
The same holds for bipartite contractions eMfT.
Thisisthestrongestbridgefoundintheinvestigation. Itsaysthatasinglesymboliccontraction
cancomputeanordinaryBooleanformuladescribingexactlytheparametervaluationsunderwhich
the corresponding concrete ring-modal event is possible.
10

11 Q4: Can formula-valued LMs represent modal effects?
Two meanings of “represent” must be distinguished.
11.1 As measurement semantics: only a restricted subset
The Paper-B logical state map is
!
L
s(L) = .
¬L
For every valuation,
( ! !)
1 0
v(s(L)) ∈ , .
0 1
So the bare Paper-B bra/ket construction yields only coordinate rows after valuation. It does not
directlyyieldtheembedded-F effect(1,1),whichalreadyoccursinastandardmodalX-typebasis.
2
Proposition 11.1 (Negative measurement-family characterization). The original Paper-B LM
pairing semantics does not generate the complete 192 reversible projective modal bases over A. It
does not even generate every reversible basis in the embedded F subtheory.
2
This is a negative version of the requested measurement-family characterization.
11.2 As coefficient data: every effect can be encoded after choices
Fix a CM cell ordering and the cyclic F -basis of A. Every a ∈ A has a unique four-bit coef-
2
ficient representation, hence a unique Boolean CM in that basis, and therefore a Paper-B LM
representative in a chosen operand frame. An effect
e = (a,b) ∈ A2
can consequently be encoded by two such LMs, and a 2×2 reversible basis by four.
Thus every modal effect is LM-encodable as coefficient data, but this encoding is:
• dependent on the chosen four-feature basis;
• dependent on CM cell order;
• dependent on the chosen LM operand frame/positive-valuation convention;
• not a derivation of effect semantics;
• not an identification of LM matrix multiplication with A-multiplication.
The correct statement is therefore:
Every modal effect is LM-encodable after the chain-ring coefficient basis is fixed, but
not every modal effect is an LM effect in the original Paper-B pairing sense.
11

12 Q5: “nonzero = possible” is extra structure
Thelatermodalsourceexplicitlyintroducesnonzeroreadoutasanadditionalcontract. Thealgebra
shows why it cannot be hidden inside ordinary Boolean valuation semantics.
Define
(0, a = 0,
σ : A → {0,1}, σ(a) =
1, a ̸= 0.
This map is neither additive in the F sense nor multiplicative to Boolean support. For example,
2
σ(u) = σ(u2) = 1,
but
σ(u+u2) = 1 ̸= 1⊕1 = 0.
More importantly, zero divisors give
u ̸= 0, u3 ̸= 0, uu3 = u4 = 0,
so
σ(u)∧σ(u3) = 1 while σ(uu3) = 0.
Proposition 12.1 (Supportisnotasemiringhomomorphism). Thenonzeromapσ : A → 2cannot
be a homomorphism from the chain ring to either the Boolean ring (2,⊕,∧) or the ordinary Boolean
semiring (2,∨,∧). Consequently, the support semantics is an independently selected zero-test rather
than a functorial quotient of the amplitude algebra.
The symbolic-support theorem does not contradict this. It says that, once the zero-test is
chosen, its valuation fibers can be represented exactly by Boolean formulas.
13 Q6: Symbolic observables/effects
The most useful symbolic generalization is not a new Boolean algebra of observables but a module
of symbolic effects:
E = (Sn)∗ ∼= S1×n.
n A A
An effect may carry genuine formulas in its coefficients, for example
e = (cid:0)(x∧¬y)+u(x⊕z), u2(f ↔ g)+u3z (cid:1) .
For a symbolic state ψ, the contraction
eψ ∈ S
A
retains the complete symbolic A-valued amplitude. Applying support gives
Supp (eψ) ∈ B,
A
a Boolean formula describing exactly when the effect is modally possible after specialization.
Thus the framework naturally exposes two levels of output:
eψ (symbolic amplitude) and Supp (eψ) (symbolic possibility condition) .
A
Callingthisan“effectalgebra”wouldcurrentlybeprematurebecausenopartialsum, orthosup-
plement, or effect-algebra order has been shown to satisfy the standard axioms. “Symbolic effect
module” or “predicate-parametrized effect calculus” is more accurate.
12

14 Q7: Sequential measurement and update
The chain ring creates a normalization problem because possible amplitudes can be nonunits.
However, reversible-basis measurements admit a clean branch update that requires no division by
the observed amplitude.
Let
B ∈ GL (A)
n
be a reversible measurement basis, with rows interpreted as effects. Let P be the diagonal coordi-
i
nate projector having a single 1 in coordinate i. Define
JB = B−1P B.
i i
Theorem 14.1 (Division-free reversible-basis update). For every commutative ring A and every
B ∈ GL (A), the maps JB satisfy
n i
(JB)2 = JB,
i i
JBJB = 0 (i ̸= j),
i j
and
X JB = I.
i
i
If
c = (Bψ) ,
i i
then
JBψ ̸= 0 ⇐⇒ c ̸= 0.
i i
Moreover,
B(JBψ) = P Bψ,
i i
so a repeat of the same measurement has support only on outcome i.
Proof. Idempotence, orthogonality, and resolution of the identity follow by conjugating the coordi-
nate projectors. Let
b = B−1e .
i i
Then
JBψ = c b .
i i i
The column b is unimodular because it is a column of an invertible matrix. Hence its entries
i
generate the unit ideal, so there exist r with
j
X r (b ) = 1.
j i j
j
If c b = 0, multiplying by the r combination yields c = 0. The converse is immediate. Finally,
i i j i
BJBψ = P Bψ.
i i
13

14.1 Projective well-definedness
If the effect rows are independently rescaled by units,
B′ = DB
with D diagonal and invertible, then
(B′)−1P B′ = B−1D−1P DB = B−1P B.
i i i
Therefore the branch projector is invariant under the same row-unit projectivization already used
by the modal support theory. Outcome permutations only relabel i.
14.2 Symbolic update
For
Be ∈ GL
n
(S
A
)
define
Jei = Be −1P
i
Be.
Then every specialization satisfies
v
A
(Jei ) = J
i
vA(Be) .
So valuation commutes with the branch-update construction as long as the symbolic basis remains
invertible under the relevant specialization.
15 Why this is not yet a closed process theory
The projector update is algebraically clean, but the zero divisors prevent the set of all nonzero
states from being a well-behaved monoidal state class.
15.1 Nonzero states are not tensor-closed
Take
ψ = (u,0), ϕ = (u3,0).
Both are nonzero, but over A
ψ⊗ ϕ = 0
A
because uu3 = u4 = 0.
15.2 Unimodular preparation is not conditioning-closed
Restricting preparations to unimodular vectors repairs the elementary tensor-annihilation problem
for simple tensors, but conditioning can leave that class. Consider the bipartite coefficient matrix
!
1 0
M = .
0 u
As a four-component vector it is unimodular because one entry is a unit. Applying Alice’s second
standard effect leaves Bob in
(0,u),
14

which is nonzero but nonunimodular.
Thereforeasatisfactoryclosedsequentialtheorystillneedsanexplicitdecisionaboutadmissible
states, branchobjects, quotients, ideals, oraricherprocesssemantics. Thesymbolicpredicatelayer
candescribewhenabranchexists,butitdoesnotturnanonunitbranchamplitudeintoaninvertible
one.
16 Failure results and exact boundaries
Proposed identification Result
“An LM is a modal effect.” False as stated. Paper-B bras evaluate only to coordinate
effects.
“Boolean valuation directly gives False. Every Boolean-ring homomorphism into the local
A-amplitudes.” chain ring lands in {0,1}.
“The ordinary 2×2 CM algebra False. The four-component identification is linear; the
is the phase ring.” cyclic product is additional structure.
“Valuation naturality derives False. It derives concrete amplitudes. The zero/nonzero
modal possibility.” interpretation is a separate support contract.
“Nonzero support is ordinary re- Falsecompositionally. XORcancellationandzerodivisors
lational semantics.” prevent support from being a semiring homomorphism.
“ExistingLMsemanticsgenerates False. The full family is LM-encodable as coefficient data
all 192 measurements.” after adding the A-structure, but not generated by the
original complement-paired effect semantics.
“Symbolic formulas solve normal- False. They can describe branch conditions but do not
ization.” invert nonunits.
“All nonzero ring states form a False: u⊗ u3 = 0.
A
monoidal state theory.”
“Unimodular preparations solve False: conditioning can yield nonunimodular nonzero
closure.” states.
“The bridge extends unchanged Falseasstated. ThecleanB⊗F Aenrichmentrequiresan
2
to arbitrary finite rings.” F -algebra such as a characteristic-two ring; other scalar
2
systems require a modified control/Boolean-power con-
struction.
17 Prior-art matrix
The novelty search translated each candidate theorem into conventional mathematics rather than
searching only CM terminology.
15

Construction/result Prior-art assessment
2×2matricesforthe16binary Known. Bricken’s1997notesexplicitlydiscussXORasbinary
truth functions addition, AND as multiplication, all 16 binary logic matrices,
truth-value vectors, and expressions of the form ⟨x|B|y⟩. Ed-
wards, Stern, and matrix-logic traditions are older.
Truth vectors and matrix logi- Known. Mizraji’s vector logic represents classical logical con-
cal gates nectives by matrices acting on Kronecker products of truth
vectors.
Quantum-flavored logical ob- Known adjacent work. Eigenlogic treats logical observables
servables in a genuine vector/Hilbert-space style distinct from Paper-B
formula-valued LMs.
Formula/Lindenbaum algebra Standard algebraic logic.
modulo logical equivalence
Valuation commuting with Standard homomorphism preservation and already proved in
matrix expressions Paper B for LM pairing.
B ⊗A enrichment and AΩ in- Standard base-change / Boolean-power mathematics. The
terpretation contribution is its application as the exact typed bridge be-
tween the two CM layers.
Boolean-to-local-ring idempo- Elementary ring theory; not a novelty target.
tent obstruction
Modal effects with possible iff Established in modal quantum theory over finite fields, espe-
nonzero cially Schumacher–Westmoreland.
Finite-field/XOR quantum- Established adjacent work in James–Ortiz–Sabry.
like programming
Semiring-valued quantum-like Established broad area; Gogioso’s framework is a direct com-
process theories parison point.
Possibilistic contextuality Established by Abramsky–Brandenburger and follow-on
as support/global-section sheaf-theoretic work.
obstruction
States/effects and categorical Established broader categorical foundations, including effec-
measurement/update tus theory.
Exact symbolic-support theo- No exact prior formulation located in this search. Best char-
rem for the CM-derived chain- acterized as a potentially useful new synthesis theorem rather
ring enrichment than a new base algebraic construction.
Negativetheoremthatoriginal Appears to be a useful internal comparison theorem; mathe-
LM pairing does not generate matically elementary once the types are separated.
the 192-basis family
B−1P B update Standard conjugated-projector/change-of-basis algebra; use-
i
ful as the natural division-free update for the current modal
model.
16

18 Adversarial interpretation
The project survives an adversarial reading, but in a narrower form than a claim of derivation.
18.1 What is routine
• valuation naturality is homomorphism preservation;
• matrix semantics for logic has substantial prior art;
• semiring/ring-valued process models and modal nonzero semantics have prior art;
• conjugated coordinate projectors are standard algebra.
18.2 What is genuinely informative in the synthesis
• the idempotent obstruction proves that the strongest direct-valuation bridge is impossible;
• the tensor-product scalar enrichment gives the correct universal replacement;
• thesupportpredicategivesanexactformula-levelrepresentationofconcretemodalpossibility;
• the effect-family comparison identifies which sense of “LM measurement” does and does not
extend to the 192 modal bases;
• theupdateconstructionshowsthatnonunitamplitudesdonotbythemselvesblockadivision-
free branch map;
• thezero-divisorclosurecounterexampleslocatetheremainingprocess-theoreticweaknesspre-
cisely.
19 Computational verification
A fresh independent checker is included as
tests/lm_modal_bridge_checks.py.
It uses only the Python standard library. The exact machine-readable output is included as
tests/lm_modal_bridge_checks_output.json.
The expanded run verified:
Check Count/result
Elements of A = F [u]/(u4) 16
2
Units 8
Idempotents exactly 0,1
|GL (A)| 24,576
2
Unordered reversible projective two-outcome bases 192
Projector idempotence checks 384
Projector orthogonality checks 384
Resolution-of-identity checks 192
17

Check Count/result
Branch nonzero iff effect coefficient nonzero 98,304
Same-basis repeatability checks 98,304
Unit row-scaling invariance checks 24,576
Symbolic support fiber checks 262,144
Paper-B LM matrix products tested 256
Products remaining in restricted 16-LM family 112
Products leaving restricted 16-LM family 144
Nonzero-state tensor annihilation example confirmed
Unimodular preparation to nonunimodular conditional ex- confirmed
ample
The 262,144 symbolic-support checks exhaust all
164 = 65,536
symbolic A-valued scalars whose four coefficient formulas are Boolean functions of two variables,
and all four valuations of those variables.
The package also preserves the original checker and output generated during the first pass, plus
rerun logs showing that both the original and expanded scripts execute successfully in the current
environment.
20 Paper implications
The bridge is strong enough to deserve a substantial theory section, but the present evidence does
not support a standalone paper whose headline claim is that Paper-B LMs derive modal quantum
measurement.
ThebestplacementisacentralsectionofthebroaderBoolean–modalsynthesispaper. Astrong
narrative is:
formula LM → Boolean-ring contraction → valuation naturality
→ idempotent obstruction → A-enrichment → symbolic-support theorem
→ modal effects/bases → extra support contract
→ division-free branch update → tensor/update closure obstruction .
This structure has three advantages:
1. it answers the skeptical question of why the original logical pairing has anything to do with
the later modal measurement rule;
2. it clearly separates generic prior art from CM-specific typing and synthesis;
3. itusesnegativetheoremsaspartofthecontributionratherthanforcinganoverstatedpositive
unification.
18

21 Strongest defensible theorem and final answer
The single best theorem to carry forward is the support-bridge statement
v (cid:0)Supp (cid:0) ⟨E,S⟩ (cid:1)(cid:1) = 1 ⇐⇒ ⟨v (E),v (S)⟩ ̸= 0.
A B⊗A A A A
Together with its existential form,
Supp (⟨E,S⟩) satisfiable ⇐⇒ ∃v : ⟨v (E),v (S)⟩ ̸= 0.
A A A A
It should be stated beside the negative companion theorem
No direct Boolean-ring valuation B → F [u]/(u4) can generate non-Boolean amplitudes.
2
The pair identifies the bridge almost exactly:
The formula-valued LM calculus and the later modal theory do more than merely coex-
ist, but the modal theory is an enriched realization of the symbolic Boolean semantics,
not a theorem forced by the original LM semantics alone. The correct bridge is scalar
enrichment plus specialization, followed by an independently declared support interpre-
tation and measurement-family choice.
A Reproducibility notes
Run the expanded checker from the root of this package with
python tests/lm_modal_bridge_checks.py
Theoutputshouldmatchtests/lm_modal_bridge_checks_output.jsonmodulotheenvironment
string. The script contains no network calls and depends only on the Python standard library.
The prior adversarial-review archive is preserved under inputs/ and unpacked under prior_
adversarial_review/. The package manifest records SHA-256 hashes for every included file.
B Search strategy
The prior-art search used conventional mathematical translations rather than CM-specific vocab-
ulary. Queries included Boolean matrix logic, matrix logic and vector logic, formula/Linden-
baum algebra, matrices over semirings, Boolean powers, modal quantum theory, finite-field quan-
tum computation, possibilistic contextuality, effectus theory, categorical quantum mechanics, and
semiring-valued quantum-like theories. The machine-readable search ledger is included separately
in research/SEARCH_LOG.csv.
References
[1] William Bricken. Notes on Matrix Techniques for Logic. March 1997. https://wbricken.
com/pdfs/01bm/01math/03math-supporting/math-tangential/04matrix-tech.pdf.
[2] C. R. Edwards. The logic of Boolean matrices. The Computer Journal, 15(3):247–253, 1972.
doi:10.1093/comjnl/15.3.247.
19

[3] August Stern. Matrix Logic: Theory and Applications. North-Holland, 1988.
doi:10.1016/C2009-0-14445-8.
[4] Eduardo Mizraji. Vector logics: The matrix-vector representation of logical calculus. Fuzzy
Sets and Systems, 50(2):179–185, 1992. doi:10.1016/0165-0114(92)90216-Q.
[5] Eduardo Mizraji. Vector logic: A natural algebraic representation of the fundamental logical
gates. Journal of Logic and Computation, 18(1):97–121, 2008. doi:10.1093/logcom/exm057.
[6] Daizhan Cheng and Hongsheng Qi. A linear representation of dynamics of
Boolean networks. IEEE Transactions on Automatic Control, 55(10):2251–2258, 2010.
doi:10.1109/TAC.2010.2043294.
[7] Daizhan Cheng, Yin Zhao, and Xiangru Xu. Matrix approach to Boolean calculus. In Proceed-
ings of the 50th IEEE CDC-ECC, pages 6950–6955, 2011. doi:10.1109/CDC.2011.6160289.
[8] Francois Dubois and Zeno Toffano. Eigenlogic: A quantum view for multiple-valued and fuzzy
systems. arXiv:1607.03509, 2016.
[9] Benjamin Schumacher and Michael D. Westmoreland. Modal quantum theory. Foundations
of Physics, 42:918–925, 2012. doi:10.1007/s10701-012-9650-z; arXiv:1010.2929.
[10] Roshan P. James, Gerardo Ortiz, and Amr Sabry. Quantum computing over finite fields:
Reversible relational programming with exclusive disjunctions. arXiv:1101.3764, 2011.
[11] Samson Abramsky and Adam Brandenburger. The sheaf-theoretic structure of non-locality
and contextuality. New Journal of Physics, 13(11):113036, 2011. doi:10.1088/1367-
2630/13/11/113036; arXiv:1102.0264.
[12] Kenta Cho, Bart Jacobs, Bas Westerbaan, and Abraham Westerbaan. An introduction to
effectus theory. arXiv:1512.05813, 2015.
[13] Stefano Gogioso. Fantastic quantum theories and where to find them. arXiv:1703.10576, 2017.
[14] Brian Theory. Operator-Level Boolean Computation with Correspondence Matrices. Unpub-
lished manuscript supplied in the ChatGPT File Library, accessed 18 September 2026.
[15] Brian Theory. Pure Boolean Modal CM Addendum. Research manuscript/source file
PURE_BOOLEAN_MODAL_CM_ADDENDUM.tex, accessed 18 September 2026.
20