Related papers: An approximate zero-one law via the Dialectica int…
Given an arbitrary long but finite sequence of observations from a finite set, we construct a simple process that approximates the sequence, in the sense that with high probability the empirical frequency, as well as the empirical one-step…
The investigation of random walks is central to a variety of stochastic processes in physics, chemistry, and biology. To describe a transport phenomenon, we study a variant of the one-dimensional persistent random walk, which we call a…
The value 1 problem is a decision problem for probabilistic automata over finite words: given a probabilistic automaton A, are there words accepted by A with probability arbitrarily close to 1? This problem was proved undecidable recently.…
The most versatile version of the classical divergence Borel-Cantelli lemma shows that for any divergent sequence of events $E_n$ in a probability space satisfying a quasi-independence condition, its corresponding limsup set $E_\infty$ has…
The problem of calculating the probability density and distribution function of a strictly stable law is considered at $x\to0$. The expansions of these values into power series were obtained to solve this problem. It was shown that in the…
Defeasible statements are statements that are likely, or probable, or usually true, but may occasionally be false. Plausible reasoning makes conclusions from statements that are either facts or defeasible statements without using numbers.…
In 2001, J.-M. Le Bars disproved the zero-one law (that says that every sentence from a certain logic is either true asymptotically almost surely (a.a.s.), or false a.a.s.) for existential monadic second order sentences (EMSO) about…
We study the error of the number of points of the lattice $\mathbb{Z}^{d}$ that fall into a dilated and translated hypercube centred around $0$ and whose axis are parallel to the axis of coordinates. We show that if $t$, the factor of…
The main result presented in this article is that probability can fundamentally be characterized as a subset of conditional expectation induced by a plausible preorder on random quantities. This is justified by the fact that probability is…
Let (\Omega,\mathcal{B},P) be a probability space, \mathcal{A} a sub-sigma-field of \mathcal{B}, and \mu a regular conditional distribution for P given \mathcal{A}. For various, classically interesting, choices of \mathcal{A} (including…
The probability of an event is in the range of [0, 1]. In a sample space S, the value of probability determines whether an outcome is true or false. The probability of an event Pr(A) that will never occur = 0. The probability of the event…
We extend the language of the classical syllogisms with the sentence-forms "At most 1 p is a q" and "More than 1 p is a q". We show that the resulting logic does not admit a finite set of syllogism-like rules whose associated derivation…
Counting propositional logic was recently introduced in relation to randomized computation and shown able to logically characterize the full counting hierarchy. In this paper we aim to clarify the intuitive meaning and expressive power of…
Anhomomorphic logic is a new interpretation of Quantum Theory (due to R. Sorkin). It is a histories formulation (c.f. consistent histories, quantum measure theory). In this approach, reality is a co-event, which is essentially an assignment…
The logic of uncertainty is not the logic of experience and as well as it is not the logic of chance. It is the logic of experience and chance. Experience and chance are two inseparable poles. These are two dual reflections of one essence,…
We provide sufficient conditions for the validity of a dichotomy, i.e. zero-one law, between recurrence and transience of general frog models. In particular, the results cover frog models with i.i.d. numbers of frogs per site where the frog…
It is well known that any pair of random variables $(X,Y)$ with values in Polish spaces, provided that $Y$ is nonatomic, can be approximated in joint law by random variables of the form $(X',Y)$ where $X'$ is $Y$-measurable and $X'…
We present a propositional logic with fundamental probabilistic semantics, in which each formula is given a real measure in the interval $[0,1]$ that represents its degree of truth. This semantics replaces the binarity of classical logic,…
Beginning with the Bell theorem, cyclic systems of dichotomous random variables have been the object of many foundational findings in quantum mechanics. Here, we ask the question: if one chooses a cyclic system "at random" (uniformly within…
In this paper, we present a comprehensive system for the treatment of the topic of limits--conceptually, computationally, and formally. The system addresses fundamental linguistic flaws in the standard presentation of limits, which attempts…