Related papers: An approximate zero-one law via the Dialectica int…
A distinction is sometimes made between "statistical" and "subjective" probabilities. This is based on a distinction between "unique" events and "repeatable" events. We argue that this distinction is untenable, since all events are "unique"…
This chapter presents probability logic as a rationality framework for human reasoning under uncertainty. Selected formal-normative aspects of probability logic are discussed in the light of experimental evidence. Specifically, probability…
We consider continuous relational structures with finite domain $[n] := \{1, \ldots, n\}$ and a many valued logic, $CLA$, with values in the unit interval and which uses continuous connectives and continuous aggregation functions. $CLA$…
A probabilistic propositional logic, endowed with an epistemic component for asserting (non-)compatibility of diagonizable and bounded observables, is presented and illustrated for reasoning about the random results of projective…
We correct and streamline the proof of the fact that, at the critical point $\alpha=1$, the vacant set of the two-dimensional random interlacements is infinite (Comets, Popov, 2017). Also, we prove a zero-one law for a natural class of tail…
Expectation is a central notion in probability theory. The notion of expectation also makes sense for other notions of uncertainty. We introduce a propositional logic for reasoning about expectation, where the semantics depends on the…
An example shows that weak decoherence is more restrictive than the minimal logical decoherence structure that allows probabilities to be used consistently for quantum histories. The probabilities in the sum rules that define minimal…
Given a finite sequence of events and a well-defined notion of events being interesting, the Odds-theorem (Bruss (2000)) gives an online strategy to stop on the last interesting event. It is optimal for independent events. Here we study…
We present a propositional logic to reason about the uncertainty of events, where the uncertainty is modeled by a set of probability measures assigning an interval of probability to each event. We give a sound and complete axiomatization…
If w is a word in d>1 letters and G is a finite group, evaluation of w on a uniformly randomly chosen d-tuple in G gives a random variable with values in G, which may or may not be uniform. It is known that if G ranges over finite simple…
The exact lower bound on the probability of the occurrence of exactly one of $n$ random events each of probability $p$ is obtained.
We study finite $l$-colourable structures with an underlying pregeometry. The probability measure that is used corresponds to a process of generating such structures (with a given underlying pregeometry) by which colours are first randomly…
The purpose of this article is to formulate a number of probabilistic hidden-variable theorems, to provide proofs in some cases, and counterexamples to some conjectured relationships. The first theorem is the fundamental one. It asserts the…
Zipf's law is just one out of many universal laws proposed to describe statistical regularities in language. Here we review and critically discuss how these laws can be statistically interpreted, fitted, and tested (falsified). The modern…
Logical theories have been developed which have allowed temporal reasoning about eventualities (a la Galton) such as states, processes, actions, events, processes and complex eventualities such as sequences and recurrences of other…
In statistical mechanics the zeroth law of thermodynamics is taken as a postulate which, as its name indicates, logically precedes the first and second laws. Treating it as a postulate has consequences for how temperature is introduced into…
We prove the trichotomy between transience to the right, transience to the left and recurrence of one-dimensional nearest-neighbour random walks in dynamic random environments under fairly general assumptions, namely: stationarity under…
About 35 years ago Wheeler introduced the motto `law without law' to highlight the possibility that (at least a part of) Physics may be understood only following {\em regularity principles} and few relevant facts, rather than relying on a…
The Lov\'{a}sz Local Lemma (LLL) states that the probability that none of a set of "bad" events happens is nonzero if the probability of each event is small compared to the number of bad events it depends on. A series of results have…
We apply recent ideas about complexity and randomness to the philosophy of laws and chances. We develop two ways to use algorithmic randomness to characterize probabilistic laws of nature. The first, a generative chance* law, employs a…