SearcharxivSearch

arXiv · 2601.00118

The universal logic of repeated experiments

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}$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sergio Daniel Grillo. 2025-12-31. The universal logic of repeated experiments. https://arxiv.org/abs/2601.00118

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

There is no maximal $K$-degree

The Kolmogorov complexity of a string characterize how complex it is to describe the string. If every prefix of a real $x$ is more complex to describe than every prefix (of the same length) of real $y$, then it is seen as $x$ is more complex to describe than $y$. It is wondered if there is a real $x$ so that no other reals are strictly more complex (to describe) than $x$. The behavior of Kolmogorov complexity functions generated by reals (namely $n\mapsto$ the minimal description length of the real) is quite chaos. Therefore, it is widely believed that there are many reals that are maximally complex to describe. For instance, it is conjectured that all random enough reals have maximal $K$-degree. In this paper, it is shown that there is no real with maximal $K$-degree. Actually, for almost all real $x$, we can uniformly computably find another real whose $K$-degree is strictly above $x$.

math.LO

Quadruples and cubes

We prove, in $\mathsf{ZFC}$, that the $\lambda$-terraced cube relation fails whenever $\lambda$ is an uncountable cardinal. The corresponding terraced relation for quadruples fails for every $\lambda$. If $\lambda$ is $\aleph_0$ then the pretinent terraced relation has consistency strength of at least one Woodin cardinal. We prove positive polarized relations at a successor and a double successor from wondrous ideals. We show, however, that there are no such ideals over two consecutive cardinals simultaneously.

math.LO

Possibilistic Logic over a Logic of Formal Inconsistency

In this article, we have introduced a new possibilistic logic on a logic of formal inconsistency with the aim of developing a possibility theoretic framework to deal with uncertainty and inconsistency meaningfully without leading to a system collapse. We have discussed the syntax and semantics for this logic and have proved the soundness and completeness theorems. A set of new measures of consistency, contradictoriness, and triviality of a set of formulas have been defined. These have then been put to use in an example to show that this framework can provide better means of machine reasoning.

math.LO