3 papers
math.LO2025
Algorithmic randomness and the weak merging of computable probability measures
Simon M. Huttegger, Sean Walsh, Francesca Zaffora Blando
We characterize Martin-Löf randomness and Schnorr randomness in terms of the merging of opinions, along the lines of the Blackwell-Dubins Theorem. After setting up a general framew…
math.LO2025
Schnorr Randomness and Effective Bayesian Consistency and Inconsistency
Simon M. Huttegger, Sean Walsh, Francesca Zaffora Blando
We study Doob's Consistency Theorem and Freedman's Inconsistency Theorem from the vantage point of computable probability and algorithmic randomness. We show that the Schnorr rando…
cs.LO2024
Simply-typed constant-domain modal lambda calculus I: distanced beta reduction and combinatory logic
Sean Walsh
A system is developed that combines modal logic and simply-typed lambda calculus, and that generalizes the system studied by Montague and Gallin. Whereas Montague…