Publications

[1] Huttegger, S. M., Walsh, S., and Zaffora Blando, F. (2026). Algorithmic randomness and the weak merging of computable probability measures. Annals of Pure and Applied Logic, 177(8), 103737: 1-27. arXiv preprint. doi: https://doi.org/10.1016/j.apal.2026.103737

[2] Huttegger, S. M., Walsh, S., and Zaffora Blando, F. (2026). Bayesian Convergence for Computably Bounded Agents. Philosophy and Phenomenological Research, 112(1): 307-324. PhilSci-Archive preprint. doi: https://doi.org/10.1111/phpr.70079

[3] Zaffora Blando, F. (2026). Algorithmic Randomness and Computable Bayesianism. Forthcoming in: Huttegger, S. and Romeijn, J.-W. (eds.), Bayesianism, Philosophical Movements Revisited, Cambridge University Press.

[4] van Benthem, J., Mierzewski, K., and Zaffora Blando, F. (2026). A New Look at the Modal Logic of Stepwise Removal. In: van Benthem, J. and Liu, F. (eds.), Graph Games and Logic Design: Recent Developments and Future Directions, Cham: Springer Nature. doi: 10.1007/978-3-031-91361-7

[5] Zaffora Blando, F. (2026). Modestly Certain. Forthcoming in: Bradley, D. (ed.), Bayesianism, Self-Doubt and Humility, Studies in Moral Philosophy, Brill Publishers.

[6] Persiau, F. and Zaffora Blando, F. (2025). Randomness and invariance. Journal of Logic and Computation, 35(8), exae083: 1-31. doi: 10.1093/logcom/exae083

[7] Zaffora Blando, F. (2025). Bayesian merging of opinions and algorithmic randomness. The British Journal for the Philosophy of Science, 76(4): 921–952. doi: 10.1086/721758 (Selected by The Philosopher's Annual as one of the ten best articles in philosophy in 2022.)

[8] Zaffora Blando, F. (2024). From Wald to Schnorr: von Mises’ definition of randomness in the aftermath of Ville’s Theorem. Studies in History and Philosophy of Science, 106: 196-207. doi: 10.1016/j.shpsa.2024.06.006

[9] Zaffora Blando, F. (2024). Pride and Probability. Philosophy of Science, 91(3): 634-660. doi: 10.1017/psa.2023.177

[10] van Benthem, J., Mierzewski, K., and Zaffora Blando, F. (2022). The Modal Logic of Stepwise Removal. The Review of Symbolic Logic, 15(1): 36-63. doi: 10.1017/S1755020320000258

[11] Zaffora Blando, F. (2021). A learning-theoretic characterisation of Martin-Löf randomness and Schnorr randomness. The Review of Symbolic Logic, 14(2): 531-549. doi: 10.1017/S175502031900042X

[12] Zaffora Blando, F., Mierzewski, K., and Areces, C. (2020). The Modal Logics of the Poison Game. In: Liu F., Ono H., and Yu J. (eds.), Knowledge, Proof and Dynamics (pp. 3-23), Logic in Asia: Studia Logica Library, Springer: Singapore. doi: 10.1007/978-981-15-2221-5_1

[13] Zaffora Blando, F. and Herbstritt, M. (2013). The Emergence of Proto-Inference through the Dynamics of Evolution and Learning. Proceedings of the Student Session of the 25th European Summer School in Logic, Language and Information.

Edited collections

[14] Klein, D., Rafiee Rad, S., and Zaffora Blando, F. (2024). Editorial. Special issue of Annals of Pure and Applied Logic on Combining Logic and Probability. doi: 10.1016/j.apal.2024.103444

Under review

[1] Huttegger, S. M., Walsh, S., and Zaffora Blando, F., Schnorr randomness and effective Bayesian consistency and inconsistency. arXiv preprint arXiv:2501.11210 [math.LO].

[2] Zaffora Blando, F. and Mierzewski, K., [Title redacted for anonymity]. A critique of Gerhard Schurz’s meta-inductive vindication of induction.

[3] Lin, H., Sterkenburg, T., and Zaffora Blando. Learning Theory. Commissioned by Oxford Bibliographies.

In preparation

[1] Zaffora Blando, F. Algorithmic Randomness. To appear in the Stanford Encyclopedia of Philosophy.

[2] Mierzewski, K. and Zaffora Blando, F., Bayesianism with a Humean Face: Between Symmetries and Best Systems.

[3] Huttegger, S. M., Walsh, S., and Zaffora Blando, F., Rates of convergence to the truth.

[4] Huttegger, S. M., Walsh, S., and Zaffora Blando, F., Algorithmic randomness, effective disintegrations, and convergence to the truth.

[5] Huttegger, S. M., Walsh, S., and Zaffora Blando, F., Algorithmic randomness and computable Polish spaces (a research monograph on algorithmic randomness and its philosophical applications in the setting of arbitrary computable Polish spaces).

[6] Persiau, F. and Zaffora Blando, F., Algorithmic randomness and merging of opinions for computationally bounded imprecise Bayesians.

Edited collections

[7] Mierzewski, K. and Zaffora Blando, F. (eds.). Special Issue of the Journal of Logic and Computation on the themes of Progic 2025: The 12th Workshop on Combining Probability and Logic.

Preprints

Huttegger, S. M., Walsh, S., and Zaffora Blando, F., Algorithmic randomness, effective disintegrations, and rates of convergence to the truth. arXiv preprint arXiv:2403.19978v2 [math.LO].

Theses and dissertations

[1] Patterns and Probabilities: A Study in Algorithmic Randomness and Computable Learning, Ph.D. Dissertation, Stanford University, ILLC Publications, ILLC Dissertations (DS) Series.

[2] From von Mises’ Impossibility of a Gambling System to Probabilistic Martingales, ILLC Publications, Master of Logic Thesis (MoL) Series.