Related papers: On ring-like structures of lattice-ordered numeric…
A Boolean power S of a commutative ring R has the structure of a commutative R-algebra, and with respect to this structure, each element of S can be written uniquely as an R-linear combination of orthogonal idempotents so that the sum of…
We discuss the definition of quantum probability in the context of "timeless" general--relativistic quantum mechanics. In particular, we study the probability of sequences of events, or multi-event probability. In conventional quantum…
Mechanisms for the automation of uncertainty are required for expert systems. Sometimes these mechanisms need to obey the properties of probabilistic reasoning. A purely numeric mechanism, like those proposed so far, cannot provide a…
Probability metrics constitute an important tool in probability theory and statistics \cite{DKS91}, \cite{R91}, \cite{Z83} as they are specific metrics on spaces of random variables which, by satisfying an extra condition, concord well with…
We investigate the structure of the Schrodinger algebra and its representations in a Fock space realized in terms of canonical Appell systems. Generalized coherent states are used in the construction of a Hilbert space of functions on which…
We start from two closure operators defined on the elements of a special kind of partially ordered sets, called causal nets. Causal nets are used to model histories of concurrent processes, recording occurrences of local states and of…
This paper introduces the order-theoretic concept of lattices along with the concept of consistent quantification where lattice elements are mapped to real numbers in such a way that preserves some aspect of the order-theoretic structure.…
We study a conditional state on a quantum logic using Renyi's approach (or Bayesian principle). This approach helps us to define independence of events and differently from the situation in the classical theory of probability, if an event…
The reverse engineering problem with probabilities and sequential behavior is introducing here, using the expression of an algorithm. The solution is partially founded, because we solve the problem only if we have a Probabilistic Sequential…
Higher-order probabilistic programming languages allow programmers to write sophisticated models in machine learning and statistics in a succinct and structured way, but step outside the standard measure-theoretic formalization of…
A hierarchical structure of isomorphic arithmetics is defined by a bijection $g_\mathbb{R}:\mathbb{R}\to \mathbb{R}$. It entails a hierarchy of probabilistic models, with probabilities $p_k=g^k(p)$, where $g$ is the restriction of…
We describe a class calculus that is expressive enough to describe and improve its own learning process. It can design and debug programs that satisfy given input/output constraints, based on its ontology of previously learned programs. It…
Pseudorandmness plays an important role in number theory, complexity theory and cryptography. Our aim is to use models of arithmetic to explain pseudorandomness by randomness. To this end we construct a set of models $\cal M$, a common…
Scaled Boolean algebras are a category of mathematical objects that arose from attempts to understand why the conventional rules of probability should hold when probabilities are construed, not as frequencies or proportions or the like, but…
Observables of a quantum system, described by self-adjoint operators in a von Neumann algebra or affiliated with it in the unbounded case, form a conditionally complete lattice when equipped with the spectral order. Using this…
This paper introduces several new classes of mathematical structures that have close connections with physics and with the theory of dynamical systems. The most general of these structures, called indivisible stochastic processes,…
Kolmogorov's foundation of probability takes measure spaces, $\sigma$-algebras, and probability measures as basic objects. It is, however, widely recognized that this classical framework is inadequate for random phenomena involving quantum…
In this paper we consider general probabilistic theories that pertain to circuits which satisfy two very natural assumptions. We provide a formalism that is local in the following very specific sense: calculations pertaining to any region…
It was proved few years ago that classes of Boolean functions definable by means of functional equations \cite{EFHH}, or equivalently, by means of relational constraints \cite{Pi2}, coincide with initial segments of the quasi-ordered set…
A comprehensive overview of lattice rules and polynomial lattice rules is given for function spaces based on $\ell_p$ semi-norms. Good lattice rules and polynomial lattice rules are defined as those obtaining worst-case errors bounded by…