Related papers: On Goodman realizability
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…
The computational properties of modal and propositional dependence logics have been extensively studied over the past few years, starting from a result by Sevenster showing NEXPTIME-completeness of the satisfiability problem for modal…
We give an extension of de Finetti's concept of coherence to unbounded (but real-valued) random variables that allows for gambling in the presence of infinite previsions. We present a finitely additive extension of the Daniell integral to…
We give a purely combinatorial proof for a two-fold generalization of van der Waerden-Brauer's theorem and Hindman's theorem. We also give tower bounds for a finite version of it.
We state and prove a generalization of Kingman's ergodic theorem on a measure-preserving dynamical system $(X,\mathcal{F},\mu,T)$ where the $\mu$-almost sure subadditivity condition $f_{n+m} \leq f_n + f_m \circ T^{n}$ is relaxed to a…
We extend de Finetti's [Ann. Inst. H. Poincar\'{e} 7 (1937) 1--68] notion of exchangeability to finite and countable sequences of variables, when a subject's beliefs about them are modelled using coherent lower previsions rather than…
New proofs are given of the existence of the compensator (or dual predictable projection) of a locally integrable c\'adl\'ag adapted process of finite variation and of the existence of the quadratic variation process for a c\'adl\'ag local…
This paper explores epistemic realizability, a form of realizability in which the property that a piece of data constitutes evidence for a logical proposition is semi-decidable. In this framework, each proposition A is assigned a verifier}…
In earlier work, we introduced flexible inference and decision-theoretic metareasoning to address the intractability of normative inference. Here, rather than pursuing the task of computing beliefs and actions with decision models composed…
Heyting-Lewis Logic is the extension of intuitionistic propositional logic with a strict implication connective that satisfies the constructive counterparts of axioms for strict implication provable in classical modal logics. Variants of…
Bayesian inference is limited in scope because it cannot be applied in idealized contexts where none of the hypotheses under consideration is true and because it is committed to always using the likelihood as a measure of evidential…
An elementary rheory of concatenation is introduced and used to establish mutual interpretability of Robinson arithmetic, Minimal Predicative Set Theory, the quantifier-free part of Kirby's finitary set theory, and Adjunctive Set Theory,…
The aim of Part II is to explore the technique of invariance of tautological equations in the realm of Gromov--Witten theory. The main result is a proof of Invariance Theorem (Invariance Conjecture~1 in [14]), via the techniques from…
We assumed that, for every natural number k, there is a natural number u such that the (k-1)th term of G(u) is k^k, and that G(u) terminates finitely. It immediately follows that every Goodstein Sequence G(m) over the natural numbers must…
We introduce a realisability semantics for infinitary intuitionistic set theory that is based on Ordinal Turing Machines (OTMs). We show that our notion of OTM-realisability is sound with respect to certain systems of infinitary…
We study a natural variant of the implicational fragment of propositional logic. Its formulas are pairs of conjunctions of positive literals, related together by an implicational-like connective; the semantics of this sort of implication is…
We present a framework for selecting and developing measures of dependence when the goal is the quantification of a relationship between two variables, not simply the establishment of its existence. Much of the literature on dependence…
Let $K$ be a field which is complete for a discrete valuation. We prove a logarithmic version of the N\'eron-Ogg-Shafarevich criterion: if $A$ is an abelian variety over $K$ which is cohomologically tame, then $A$ has good reduction in the…
It is often claimed that analysis with infinitesimals requires more substantial use of the Axiom of Choice than traditional elementary analysis. The claim is based on the observation that the hyperreals entail the existence of nonprincipal…
Richard Cox [1] set the axiomatic foundations of probable inference and the algebra of propositions. He showed that consistency within these axioms requires certain rules for updating belief. In this paper we use the analogy between…