Related papers: An approximate zero-one law via the Dialectica int…
The first contribution of this paper is the presentation of a Pavelka - like formulation of possibilistic logic in which the language is naturally enriched by two connectives which represent negation (eg) and a new type of conjunction…
We develop a new $L^1$ law of large numbers where the $i$-th summand is given by a function $h(\cdot)$ evaluated at $X_i - \theta_n$, and where $\theta_n \circeq \theta_n(X_1,X_2,\ldots,X_n)$ is an estimator converging in probability to…
We study fixpoints of operators on lattices. To this end we introduce the notion of an approximation of an operator. We order approximations by means of a precision ordering. We show that each lattice operator O has a unique most precise or…
A necessary and sufficient condition for a L\'evy process $X$ to stay positive, in probability, near 0, which arises in studies of Chung-type laws for $X$ near 0, is given in terms of the characteristics of $X$.
Let $\mathcal G$ be an addable, minor-closed class of graphs. We prove that the zero-one law holds in monadic second-order logic (MSO) for the random graph drawn uniformly at random from all {\em connected} graphs in $\mathcal G$ on $n$…
We give an algorithm A which assigns probabilities to logical sentences. For any simple infinite sequence of sentences whose truth-values appear indistinguishable from a biased coin that outputs "true" with probability p, we have that the…
Two infinite 0-1 sequences are called compatible when it is possible to cast out 0's from both in such a way that they become complementary to each other. Answering a question of Peter Winkler, we show that if the two 0-1-sequences are…
A length dependence of the effective mobility in the form of a power law, B ~ L^(1-1/alpha) is observed in dispersive transport in amorphous substances, with 0 < \alpha < 1. We deduce this behavior as a simple consequence of the statistical…
We provide a logical framework in which a resource-bounded agent can be seen to perform approximations of probabilistic reasoning. Our main results read as follows. First we identify the conditions under which propositional probability…
The purpose of this paper is to present a mathematical theory that can be used as a foundation for statistics that include improper priors. This theory includes improper laws in the initial axioms and has in particular Bayes theorem as a…
Power-law sensitivity to initial conditions, characterizing the behaviour of dynamical systems at their critical points (where the standard Liapunov exponent vanishes), is studied in connection with the family of nonlinear 1D logistic-like…
We prove a general ergodic-theoretic result concerning the return time statistic, which, properly understood, sheds some new light on the common sense phenomenon known as {\it the law of series}. Let \proc be an ergodic process on finitely…
We consider a conception of reality that is the following: An object is 'real' if we know that if we would try to test whether this object is present, this test would give us the answer 'yes' with certainty. If we consider a conception of…
Abstraction and realization are bilateral processes that are key in deriving intelligence and creativity. In many domains, the two processes are approached through rules: high-level principles that reveal invariances within similar yet…
The problem addressed concerns the determination of the average number of successive attempts of guessing a word of a certain length consisting of letters with given probabilities of occurrence. Both first- and second-order approximations…
Kurzweil's theorem ('55) is concerned with zero-one laws for well approximable targets in inhomogeneous Diophantine approximation under the badly approximable assumption. In this article, we prove the divergent part of a Kurzweil type…
A common statistical task lies in showing asymptotic normality of certain statistics. In many of these situations, classical textbook results on weak convergence theory suffice for the problem at hand. However, there are quite some…
Predicate Logic with Definitions (PLD or D-logic) is a modification of first-order logic intended mostly for practical formalization of mathematics. The main syntactic constructs of D-logic are terms, formulas and definitions. A definition…
A classical Borel Cantelli Lemma gives conditions for deciding whether an infinite number of rare events will almost surely happen. In this article, we propose an extension of Borel Cantelli Lemma to characterize the multiple occurrence of…
Approximate Bayesian Computation (ABC) is a popular computational method for likelihood-free Bayesian inference. The term "likelihood-free" refers to problems where the likelihood is intractable to compute or estimate directly, but where it…