Journal publications

[1] Zaffora Blando, F. (2024). From Wald to Schnorr: von Mises’ definition of randomness in the aftermath of Ville’s Theorem. Forthcoming at Studies in History and Philosophy of Science.

[2] Zaffora Blando, F. (2024). Pride and Probability. Forthcoming at Philosophy of Science. doi: 10.1017/psa.2023.177

[3] Zaffora Blando, F. (2022). Bayesian merging of opinions and algorithmic randomness. The British Journal for the Philosophy of Science. doi: 10.1086/721758 (Selected for inclusion in The Philosopher's Annual as one of the ten best papers in philosophy in 2022)

[4] 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

[5] 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

Commissioned/Invited

[1] van Benthem, J., Mierzewski, K., and Zaffora Blando, F. (2024). A New Look at the Modal Logic of Stepwise Removal. Forthcoming in: van Benthem, J. and Liu, F. (eds.), Graph Games and Logic Design: Recent Developments and Future Directions, Springer Nature.

[2] Lin, H., Sterkenburg, T., and Zaffora Blando, F. (2024). Learning Theory. Forthcoming at Oxford Bibliographies.

Conference proceedings

[1] 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

[2] 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

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., Walsh, S., and Zaffora Blando, F., Algorithmic randomness, effective disintegrations, and rates of convergence to the truth. arXiv preprint arXiv:2403.19978 [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] Persiau, F. and Zaffora Blando, F., Randomness and Invariance.

In preparation

[1] Mierzewski, K. and Zaffora Blando, F., Lewis vs. de Finetti: chances for computable Bayesian agents.

[2] Huttegger, S., Walsh, S., and Zaffora Blando, F., Bayesian Randomness.

Commissioned/Invited

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

[4] Zaffora Blando, F. Algorithmic Randomness, Stanford Encyclopedia of Philosophy.

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

Theses and dissertations

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

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