Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2601.00118

The universal logic of repeated experiments

Sergio Daniel Grillo

Published Dec 31, 2025• 0 citations
arXivHTMLPDF

Abstract

Let $\mathsf{E}$ be the event space of an experiment that can be indefinitely repeated. A natural question arises: given a countable cardinal $κ$, which is the event space of the $κ$-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^κ$ generated by $\mathsf{E}^κ$. But, what if $\mathsf{E}$ is not a Boolean algebra? In this paper we give a constructive answer to this question for any $κ$ 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}_κ\left(\mathsf{E}\right)$ representing the event space of the $κ$-times repeated experiment, in such a way that $\mathsf{U}_κ\left(\mathsf{E}\right)$ and $\mathsf{E}$ are isomorphic if $κ=1$, and such that $\mathsf{U}_κ\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 $κ$ is arbitrary. This gives rise to tensor products $\bigotimes_{α\inκ}\mathsf{E}_α$ of families $\left\{ \mathsf{E}_α\right\} _{α\inκ}$ of orthocomplemented complete lattices, in terms of which $\mathsf{U}_κ\left(\mathsf{E}\right)=\bigotimes_{α\inκ}\mathsf{E}$.

DOI
10.48550/arxiv.2601.00118

Related papers

Completion of the Causal Completability Problem

Michał Marczyk, Leszek Wroński

We give a few results concerning the notions of causal completability and causal closedness of classical probability spaces (Hofer-Szabó et al. [1999]; Gyenis and Rédei [2004]). We prove that (i) any classical probability space has a causally closed extension; (ii) any finite classical probability space with positive rational probabilities on the atoms of the event algebra can be extended to a causally up-to-three-closed finite space; and (iii) any classical probability space can be extended to a space in which all correlations between events that are logically independent modulo measure zero event have a countably infinite common-cause system. Collectively, these results show that it is surprisingly easy to find Reichenbach-style ‘explanations' for correlations, underlining doubts as to whether this approach can yield a philosophically relevant account of causality. 1 Introduction2 Basic Definitions and Results in the Literature3 Causal Completability the Easy Way: ‘Splitting the Atom’4 Causal Completability of Classical Probability Spaces: The General Case5 Infinite Statistical Common-Cause Systems for Arbitrary Pairs6 Conclusion Appendix A

The British Journal for the Philosophy of Science•Mar 23, 2014•17 citations

Quantum logics representable as kernels of measures

Mirko Navara

Tlic classical Kohnogorov's model of probability assumes that every pair of ev(Tits is siinult.aneouslyobservable.This principle is violated in several applications including quantum mechanics, artificial intelligence, psychology, sociology etc.In these areas iioneoinpatible events are encountered.These are events which can be observed separately, but not simultaneously, so they are not contained in a Boolean subalgebra i = classical subsystem) of the event structure describing the system in question.Various attempts have been made to generalize the probability theory to a more general structure admitting noneonipatibility.Among them, classes of subsets (more generally, concrete logics) wore studied for many years (see e.g.[15, 18]).Although some results were successfully generalized (see e.g.[4. 10, 19]).the theory proceeded slowly and with serious difficulties.Hero we introduce a more special-but still reasonably general-structure, a kernel logic.As it is described in terms of Boolean algebras using measure-theoretic notions, we believe that there is a greater chance to generalize classical results for Boolean algebras to kernel logics.Kernel logics seem to be interesting also from the algebraic point of view as a new const ruction technique for concrete logics.Its usefulness was proved by solutions of several quite nontrivial problems.Besides this, it scorns desirable to describe kernels of measures on Boolean algebras.

Czechoslovak Mathematical Journal•Jan 1, 1996•6 citations

Probability Theory on the Lattice of Projections in a Hilbert Space

Kalyanapuram Rangachari Parthasarathy

In classical probability theory one assumes that all the events concerning a statistical experiment constitute a Boolean σ-algebra and defines a probability measure as a completely additive non-negative function which assigns the value unity for the identity element of the σ-algebra. Invariably, the σ-algebra is the Borel σ-algebra \( \mathcal{B} \) X (i.e., the smallest σ-algebra generated by the open subsets) of a nice topological space X. Under very general conditions it turns out that all probability measures on \( \mathcal{B} \) X constitute a convex set whose extreme points are degenerate probability measures.

Texts and readings in mathematics•Jan 1, 2005•0 citations

Concrete quantum logics with generalised compatibility

Josef Tkadlec

We present three results stating when a concrete (=set-representable) quantum logic with covering properties (generalization of compatibility) has to be a Boolean algebra. These results complete and generalize some previous results [3, 5] and answer partiallz a question posed in [2].

Mathematica Bohemica•Jan 1, 1998•1 citation

On ring-like structures of lattice-ordered numerical events

Dietmar W. Dorninger, Helmut Länger

Let [Formula: see text] be a set of states of a physical system. The probabilities [Formula: see text] of the occurrence of an event when the system is in different states [Formula: see text] define a function from [Formula: see text] to [Formula: see text] called a numerical event or, more accurately, an [Formula: see text]-probability. Sets of [Formula: see text]-probabilities ordered by the partial order of functions give rise to so-called algebras of [Formula: see text]-probabilities, in particular, to the ones that are lattice-ordered. Among these, there are the [Formula: see text]-algebras known from probability theory and the Hilbert-space logics which are important in quantum-mechanics. Any algebra of [Formula: see text]-probabilities can serve as a quantum-logic, and it is of special interest when this logic turns out to be a Boolean algebra because then the observed physical system will be classical. Boolean algebras are in one-to-one correspondence to Boolean rings, and the question arises to find an analogue correspondence for lattice-ordered algebras of [Formula: see text]-probabilities generalizing the correspondence between Boolean algebras and Boolean rings. We answer this question by defining ring-like structures of events (RLSEs). First, the structure of RLSEs is revealed and Boolean rings among RLSEs are characterized. Then we establish how RLSEs correspond to lattice-ordered algebras of numerical events. Further, functions for associating lattice-ordered algebras of [Formula: see text]-probabilities to RLSEs are studied. It is shown that there are only two ways to assign lattice-ordered algebras of [Formula: see text]-probabilities to RLSEs if one restricts the corresponding mappings to term functions over the underlying orthomodular lattice. These term functions are the very functions by which also the Boolean algebras can be assigned to Boolean rings.

arXiv:2008.04961•Asian-European Journal of Mathematics•Mar 12, 2021•1 citation

Generalized possibilistic Theories: the multipartite experiments problem

E. Buffenoir

In a recent paper, the author introduced an operational description of physical theories where probabilities are replaced by counterfactual statements belonging to a three-valued (i.e. possibilistic) semantic domain. The complete axiomatic of these Generalized possibilistic Theories is generalized and clarified in the present paper. The problem of bipartite experiments is then addressed as the main skill of this paper. An axiomatic for the tensor product of our spaces of states is given and different solutions are explicitly constructed. This description of tensor products of Inf semi-lattices is partly independent from the usual mathematical description of this problem. The nature of the tensor product of orthocomplemented Inf semi-lattices is then also explored. This subject is indeed fundamental for the development of a reconstruction program for quantum theory within our framework. Our analysis constitutes a first step towards this achievement.

arXiv:2207.09905•Jul 19, 2022•0 citations
Let E\mathsf{E}E be the event space of an experiment that can be indefinitely repeated. A natural question arises: given a countable cardinal κκκ, which is the event space of the κκκ-times repeated experiment? In the case of classical experiments, where E\mathsf{E}E is a (complete) Boolean algebra on some set SSS, i.e. a classical or distributive logic, the answer is more or less known: the (complete) Boolean algebra on SκS^κSκ generated by Eκ\mathsf{E}^κEκ. But, what if E\mathsf{E}E is not a Boolean algebra? In this paper we give a constructive answer to this question for any κκκ and in the context of general orthocomplemented complete lattices, i.e. general logics. Concretely, given a general logic E\mathsf{E}E defining the event space of a given experiment, we construct a logic Uκ(E)\mathsf{U}_κ\left(\mathsf{E}\right)Uκ​(E) representing the event space of the κκκ-times repeated experiment, in such a way that Uκ(E)\mathsf{U}_κ\left(\mathsf{E}\right)Uκ​(E) and E\mathsf{E}E are isomorphic if κ=1κ=1κ=1, and such that Uκ(E)\mathsf{U}_κ\left(\mathsf{E}\right)Uκ​(E) is distributive if and only if so is E\mathsf{E}E. We also extend our construction to the case in which the event space changes from one repetition to another and the cardinal κκκ is arbitrary. This gives rise to tensor products ⨂α∈κEα\bigotimes_{α\inκ}\mathsf{E}_α⨂α∈κ​Eα​ of families {Eα}α∈κ\left\{ \mathsf{E}_α\right\} _{α\inκ}{Eα​}α∈κ​ of orthocomplemented complete lattices, in terms of which Uκ(E)=⨂α∈κE\mathsf{U}_κ\left(\mathsf{E}\right)=\bigotimes_{α\inκ}\mathsf{E}Uκ​(E)=⨂α∈κ​E.
We give a few results concerning the notions of causal completability and causal closedness of classical probability spaces (Hofer-Szabó et al. [1999]; Gyenis and Rédei [2004]). We prove that (i) any classical probability space has a causally closed extension; (ii) any finite classical probability space with positive rational probabilities on the atoms of the event algebra can be extended to a causally up-to-three-closed finite space; and (iii) any classical probability space can be extended to a space in which all correlations between events that are logically independent modulo measure zero event have a countably infinite common-cause system. Collectively, these results show that it is surprisingly easy to find Reichenbach-style ‘explanations' for correlations, underlining doubts as to whether this approach can yield a philosophically relevant account of causality. 1 Introduction2 Basic Definitions and Results in the Literature3 Causal Completability the Easy Way: ‘Splitting the Atom’4 Causal Completability of Classical Probability Spaces: The General Case5 Infinite Statistical Common-Cause Systems for Arbitrary Pairs6 Conclusion Appendix A
Tlic classical Kohnogorov's model of probability assumes that every pair of ev(Tits is siinult.aneouslyobservable.This principle is violated in several applications including quantum mechanics, artificial intelligence, psychology, sociology etc.In these areas iioneoinpatible events are encountered.These are events which can be observed separately, but not simultaneously, so they are not contained in a Boolean subalgebra i = classical subsystem) of the event structure describing the system in question.Various attempts have been made to generalize the probability theory to a more general structure admitting noneonipatibility.Among them, classes of subsets (more generally, concrete logics) wore studied for many years (see e.g.[15, 18]).Although some results were successfully generalized (see e.g.[4. 10, 19]).the theory proceeded slowly and with serious difficulties.Hero we introduce a more special-but still reasonably general-structure, a kernel logic.As it is described in terms of Boolean algebras using measure-theoretic notions, we believe that there is a greater chance to generalize classical results for Boolean algebras to kernel logics.Kernel logics seem to be interesting also from the algebraic point of view as a new const ruction technique for concrete logics.Its usefulness was proved by solutions of several quite nontrivial problems.Besides this, it scorns desirable to describe kernels of measures on Boolean algebras.
In classical probability theory one assumes that all the events concerning a statistical experiment constitute a Boolean σ-algebra and defines a probability measure as a completely additive non-negative function which assigns the value unity for the identity element of the σ-algebra. Invariably, the σ-algebra is the Borel σ-algebra B \mathcal{B} B X (i.e., the smallest σ-algebra generated by the open subsets) of a nice topological space X. Under very general conditions it turns out that all probability measures on B \mathcal{B} B X constitute a convex set whose extreme points are degenerate probability measures.
Let [Formula: see text] be a set of states of a physical system. The probabilities [Formula: see text] of the occurrence of an event when the system is in different states [Formula: see text] define a function from [Formula: see text] to [Formula: see text] called a numerical event or, more accurately, an [Formula: see text]-probability. Sets of [Formula: see text]-probabilities ordered by the partial order of functions give rise to so-called algebras of [Formula: see text]-probabilities, in particular, to the ones that are lattice-ordered. Among these, there are the [Formula: see text]-algebras known from probability theory and the Hilbert-space logics which are important in quantum-mechanics. Any algebra of [Formula: see text]-probabilities can serve as a quantum-logic, and it is of special interest when this logic turns out to be a Boolean algebra because then the observed physical system will be classical. Boolean algebras are in one-to-one correspondence to Boolean rings, and the question arises to find an analogue correspondence for lattice-ordered algebras of [Formula: see text]-probabilities generalizing the correspondence between Boolean algebras and Boolean rings. We answer this question by defining ring-like structures of events (RLSEs). First, the structure of RLSEs is revealed and Boolean rings among RLSEs are characterized. Then we establish how RLSEs correspond to lattice-ordered algebras of numerical events. Further, functions for associating lattice-ordered algebras of [Formula: see text]-probabilities to RLSEs are studied. It is shown that there are only two ways to assign lattice-ordered algebras of [Formula: see text]-probabilities to RLSEs if one restricts the corresponding mappings to term functions over the underlying orthomodular lattice. These term functions are the very functions by which also the Boolean algebras can be assigned to Boolean rings.
In a recent paper, the author introduced an operational description of physical theories where probabilities are replaced by counterfactual statements belonging to a three-valued (i.e. possibilistic) semantic domain. The complete axiomatic of these Generalized possibilistic Theories is generalized and clarified in the present paper. The problem of bipartite experiments is then addressed as the main skill of this paper. An axiomatic for the tensor product of our spaces of states is given and different solutions are explicitly constructed. This description of tensor products of Inf semi-lattices is partly independent from the usual mathematical description of this problem. The nature of the tensor product of orthocomplemented Inf semi-lattices is then also explored. This subject is indeed fundamental for the development of a reconstruction program for quantum theory within our framework. Our analysis constitutes a first step towards this achievement.