Related papers: Probabilities are always axiomatizable

We first study probabilistic dynamical systems from logical perspective. To this purpose, we introduce the finitary dynamic probability logic} ($\mathsf{DPL}$), as well as its infinitary extension $\mathsf{DPL}_{\omega_1}\!$. Both these…

This work proposes a view of probability as a relative measure rather than an absolute one. To demonstrate this concept, we focus on finite outcome spaces and develop three fundamental axioms that establish requirements for relative…

In the interpretation of experimental data, one is actually looking for plausible explanations. We look for a measure of plausibility, with which we can compare different possible explanations, and which can be combined when there are…

We consider the relation between knowledge and certainty, where a fact is known if it is true at all worlds an agent considers possible and is certain if it holds with probability 1. We identify certainty with probabilistic belief. We show…

Automated reasoning about uncertain knowledge has many applications. One difficulty when developing such systems is the lack of a completely satisfactory integration of logic and probability. We address this problem directly. Expressive…

Coalition logic is one of the most popular logics for multi-agent systems. While epistemic extensions of coalition logic have received much attention, existence of their complete axiomatisations has so far been an open problem. In this…

This contribution derives from a rather extensive study on the foundations of probability. We start by discussing critically the two main models of the random event in Probability Theroy and cast light over a number of incongruities. We…

We propose an inequality paradigm for probabilistic reasoning based on a logic of upper and lower bounds on conditional probabilities. We investigate a family of probabilistic logics, generalizing the work of Nilsson [14]. We develop a…

In this paper, we tell a story about incompleteness in modal logic. The story weaves together a paper of van Benthem, `Syntactic aspects of modal incompleteness theorems,' and a longstanding open question: whether every normal modal logic…

A nonmonotonic logic of thresholded generalizations is presented. Given propositions A and B from a language L and a positive integer k, the thresholded generalization A=>B{k} means that the conditional probability P(B|A) falls short of one…

We study the convex-hull problem in a probabilistic setting, motivated by the need to handle data uncertainty inherent in many applications, including sensor databases, location-based services and computer vision. In our framework, the…

We present probabilistic approaches to check the validity of selected connexive principles within the setting of coherence. Connexive logics emerged from the intuition that conditionals of the form "If $\sim A$, then $A$", should not hold,…

We prove that there are continuum-many axiomatic extensions of the full Lambek calculus with exchange that have the deductive interpolation property. Further, we extend this result to both classical and intuitionistic linear logic as well…

The paper studies the containment companion of a logic $\vdash$. This consists of the consequence relation $\vdash^{r}$ which satisfies all the inferences of $\vdash$, where the variables of the conclusion are \emph{contained} into those of…

Autoregressive Large Language Models (LLMs) trained for next-word prediction have demonstrated remarkable proficiency at producing coherent text. But are they equally adept at forming coherent probability judgments? We use probabilistic…

We investigate cut-elimination and cut-simulation in impredicative (higher-order) logics. We illustrate that adding simple axioms such as Leibniz equations to a calculus for an impredicative logic -- in our case a sequent calculus for…

The compactness theorem for a logic states, roughly, that the satisfiability of a set of well-formed formulas can be determined from the satisfiability of its finite subsets, and vice versa. Usually, proofs of this theorem depend on the…

It has been widely acknowledged that probabilistic independence and logical independence cannot be coherently reconciled. By bridging these two notions, this paper addresses three long-standing problems that have puzzled the field of…

A simple symmetric random walk in the space $\mathbb{Z}^2$ is considered. The asymptotic behavior as the number of jumps tends to infinity of the probability that a fixed edge of the random walk lies in the polygon that forms the boundary…

The idea of fully accepting statements when the evidence has rendered them probable enough faces a number of difficulties. We leave the interpretation of probability largely open, but attempt to suggest a contextual approach to full belief.…