works on
combinatory logic 1modal lambda calculus 1semantic conservation 1simply-typed lambda calculus 1type theory 1

From the 1 of 3 linked papers with an AI index.

most citedSimply-typed constant-domain modal lambda calculus I: distanced beta reduction and combinatory logic

1 citations · 1 across the 1 of their papers we have counts for

collaborators
Showing math.LOShow all

3 papers · 1 filter

math.LO2026

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 frame…

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…

math.LO2024

Algorithmic Randomness, Effective Disintegrations, and Rates of Convergence to the Truth

Simon M. Huttegger, Sean Walsh, Francesca Zaffora Blando

Lévy's Upward Theorem says that the conditional expectation of an integrable random variable converges with probability one to its true value with increasing information. In this…