The universal logic of repeated experiments

Sergio Daniel Grillo

arxiv: 2601.00118 · v2 · submitted 2025-12-31 · 🧮 math.LO · math-ph· math.MP· math.RA

The universal logic of repeated experiments

Sergio Daniel Grillo This is my paper

Pith reviewed 2026-05-16 18:35 UTC · model grok-4.3

classification 🧮 math.LO math-phmath.MPmath.RA

keywords logicrepeated experimentsorthocomplemented latticesdistributivitytensor productsevent spacesuniversal construction

0 comments

The pith

Given any logic E for an experiment, there is a universal logic U_κ(E) for its κ repetitions that is isomorphic to E when κ=1 and distributive exactly when E is.

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

The paper addresses what the event space becomes when any experiment, possibly non-classical, is repeated κ times for arbitrary cardinal κ. It supplies an explicit construction of the corresponding logic U_κ(E) starting from the original orthocomplemented complete lattice E. This matters to a sympathetic reader because it generalizes the familiar product construction that works for classical Boolean algebras to the full setting of general logics, thereby giving a consistent way to model repeated measurements or trials whose individual events do not obey distributivity. The same method produces tensor products when the logic itself may change from one repetition to the next.

Core claim

Given a general logic E, an orthocomplemented complete lattice that represents the event space of an experiment, the paper constructs a logic U_κ(E) that represents the event space of the κ-times repeated experiment. This U_κ(E) satisfies U_κ(E) isomorphic to E whenever κ=1, and U_κ(E) is distributive if and only if E is distributive. The construction extends without change to the case of arbitrary families of possibly distinct logics by means of their tensor product.

What carries the argument

The universal construction U_κ(E), equivalently the tensor product ⊗_{α∈κ} E_α, that produces the event space of the repeated experiment while enforcing the stated isomorphism and distributivity-preservation properties.

If this is right

The familiar Boolean-algebra construction on the product set S^κ is recovered when E is already distributive.
Non-distributive logics remain non-distributive under any number of repetitions.
The same tensor-product operation yields a well-defined event space when each repetition may obey a different logic.
The construction applies uniformly to finite and infinite cardinals.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

This supplies a candidate joint-event algebra for sequences of quantum measurements that avoids forcing classical distributivity.
Probability assignments or states on the original E could be lifted canonically to U_κ(E) for use in repeated-trial statistics.
Direct comparison of this tensor product with other proposed products in the quantum-logic literature would test uniqueness of the universal property.

Load-bearing premise

That a single universal construction U_κ(E) exists for arbitrary orthocomplemented complete lattices that satisfies the stated isomorphism and distributivity-preservation properties for every cardinal κ.

What would settle it

An explicit orthocomplemented complete lattice E together with a cardinal κ>1 such that the constructed U_κ(E) is either not isomorphic to E or is distributive when E is not (or vice versa).

read the original abstract

Let $\mathsf{E}$ be the event space of an experiment that can be indefinitely repeated. A natural question arises: given a countable cardinal $\kappa$, which is the event space of the $\kappa$-times repeated experiment? In the case of classical experiments, where $\mathsf{E}$ is a (complete) Boolean algebra on some set $S$, i.e. a classical or distributive logic, the answer is more or less known: the (complete) Boolean algebra on $S^{\kappa}$ generated by $\mathsf{E}^{\kappa}$. But, what if $\mathsf{E}$ is not a Boolean algebra? In this paper we give a constructive answer to this question for any $\kappa$ and in the context of general orthocomplemented complete lattices, i.e. general logics. Concretely, given a general logic $\mathsf{E}$ defining the event space of a given experiment, we construct a logic $\mathsf{U}_{\kappa}\left(\mathsf{E}\right)$ representing the event space of the $\kappa$-times repeated experiment, in such a way that $\mathsf{U}_{\kappa}\left(\mathsf{E}\right)$ and $\mathsf{E}$ are isomorphic if $\kappa=1$, and such that $\mathsf{U}_{\kappa}\left(\mathsf{E}\right)$ is distributive if and only if so is $\mathsf{E}$. We also extend our construction to the case in which the event space changes from one repetition to another and the cardinal $\kappa$ is arbitrary. This gives rise to tensor products $\bigotimes_{\alpha\in\kappa}\mathsf{E}_{\alpha}$ of families $\left\{ \mathsf{E}_{\alpha}\right\} _{\alpha\in\kappa}$ of orthocomplemented complete lattices, in terms of which $\mathsf{U}_{\kappa}\left(\mathsf{E}\right)=\bigotimes_{\alpha\in\kappa}\mathsf{E}$.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

Grillo gives an explicit tensor-product construction for the logic of repeated experiments that works for any orthocomplemented complete lattice and preserves distributivity in both directions.

read the letter

The main contribution is a direct definition of U_κ(E) as the tensor product of κ copies of an orthocomplemented complete lattice E. This models the event space after κ repetitions, reduces to E itself when κ=1, and is distributive if and only if E is. The same construction extends to families of possibly different lattices E_α, which covers the case where the logic changes across repetitions. When E is Boolean the tensor product recovers the usual Boolean algebra on the product space, so the classical case sits inside the general one without extra work. The stress-test note confirms that once the tensor product is defined, the isomorphism and distributivity properties follow without circularity or extra assumptions. That is the useful part: a uniform, constructive answer that does not require E to be distributive from the start. The paper does this cleanly for arbitrary cardinals κ, including infinite ones. The soft spots are small. The construction must still be shown to yield another orthocomplemented complete lattice, and the proofs of the preservation properties need to be checked in detail, but the abstract and stress-test give no sign of a load-bearing gap. A short concrete example with a small non-Boolean lattice would help readers see the difference from the classical case, but its absence is not fatal. This is for logicians and quantum foundations people who already handle orthocomplemented lattices and need a way to model sequences of measurements. A reader who knows the Boolean repeated-experiment construction will see exactly what has been generalized. The work is concrete enough and the claims checkable enough that it deserves peer review rather than a desk rejection.

Referee Report

2 major / 3 minor

Summary. The manuscript constructs a logic U_κ(E) representing the event space of a κ-times repeated experiment, where E is an orthocomplemented complete lattice. The construction proceeds explicitly via the tensor product ⊗_{α∈κ} E_α of copies of E (or of a family of possibly distinct lattices E_α when the event space varies across repetitions). It is claimed that this satisfies U_κ(E) ≅ E whenever κ = 1 and that U_κ(E) is distributive if and only if E is distributive. The result is stated for both countable and arbitrary cardinals κ.

Significance. If the explicit tensor-product construction is verified to satisfy the stated isomorphism and distributivity-preservation properties, the paper supplies a canonical, universal way to form repeated-event logics in the non-distributive setting. This directly generalizes the classical Boolean-algebra case (power-set algebra on S^κ) to arbitrary orthocomplemented complete lattices and therefore has potential foundational value for quantum logic and probability theory on general event spaces. The constructive character of the definition is a clear strength, as it permits direct checking of the required algebraic properties.

major comments (2)

§3, Definition of the tensor product ⊗_{α∈κ} E_α: the manuscript must supply an explicit verification that the orthocomplementation and completeness operations defined on the tensor product satisfy all axioms of an orthocomplemented complete lattice; without this step the claim that U_κ(E) is itself a logic remains formal.
§4, Theorem on distributivity preservation: the proof that U_κ(E) is distributive precisely when E is must be checked for the converse direction; the argument should not rely on the classical embedding that is available only when E is already distributive.

minor comments (3)

The introduction should state the precise definition of the tensor product (or at least the key universal property it satisfies) before the main theorems, rather than deferring it entirely to §3.
Notation: the use of boldface or sans-serif for lattices (E vs. U_κ(E)) is inconsistent between the abstract and the body; adopt a single convention throughout.
Add a short comparison paragraph relating the new tensor product to existing constructions of tensor products of orthomodular lattices in the quantum-logic literature.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the positive assessment of the manuscript and for the constructive comments. We address each major comment below.

read point-by-point responses

Referee: §3, Definition of the tensor product ⊗_{α∈κ} E_α: the manuscript must supply an explicit verification that the orthocomplementation and completeness operations defined on the tensor product satisfy all axioms of an orthocomplemented complete lattice; without this step the claim that U_κ(E) is itself a logic remains formal.

Authors: We agree that an explicit verification is required. In the revised manuscript we will insert a dedicated verification subsection confirming that the orthocomplementation, joins and meets defined on the tensor product satisfy all axioms of an orthocomplemented complete lattice. revision: yes
Referee: §4, Theorem on distributivity preservation: the proof that U_κ(E) is distributive precisely when E is must be checked for the converse direction; the argument should not rely on the classical embedding that is available only when E is already distributive.

Authors: The converse direction in the distributivity theorem is established directly from the explicit tensor-product construction and the universal property, without invoking any embedding into a classical structure. We will revise the proof to state this independence more explicitly and to supply any additional intermediate steps for clarity. revision: yes

Circularity Check

0 steps flagged

Explicit tensor-product construction is self-contained

full rationale

The paper supplies an explicit definition of U_κ(E) as the tensor product ⊗_{α∈κ} E_α of orthocomplemented complete lattices. The required isomorphism for κ=1 and the bidirectional preservation of distributivity are then proved as consequences of this definition rather than being built into the definition itself or imported via self-citation. No load-bearing step reduces to a fitted parameter, a self-referential equation, or an unverified uniqueness claim; the derivation therefore remains independent of its target properties.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The construction rests on the standard definition of orthocomplemented complete lattices as the ambient category for general logics; no free parameters or new entities are introduced in the abstract.

axioms (1)

domain assumption Event spaces of experiments are modeled by orthocomplemented complete lattices
Stated in the abstract as the setting for both classical and general logics

pith-pipeline@v0.9.0 · 5630 in / 1137 out tokens · 22753 ms · 2026-05-16T18:35:29.370489+00:00 · methodology

discussion (0)

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

IndisputableMonolith/Foundation/LogicAsFunctionalEquation.lean reality_from_one_distinction unclear

?

unclear
Relation between the paper passage and the cited Recognition theorem.

given a general logic E ... construct a logic U_κ(E) ... U_κ(E) is distributive if and only if so is E ... tensor products ⊗_{α∈κ} E_α
IndisputableMonolith/Cost/FunctionalEquation.lean washburn_uniqueness_aczel unclear

?

unclear
Relation between the paper passage and the cited Recognition theorem.

D_κ(E) is completely distributive ... closure operator * * ... U_κ(E) = D_κ(E)**

What do these tags mean?

matches: The paper's claim is directly supported by a theorem in the formal canon.
supports: The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends: The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses: The paper appears to rely on the theorem as machinery.
contradicts: The paper's claim conflicts with a theorem or certificate in the canon.
unclear: Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.