Francesca Zaora Blando

Department of Philosophy Carnegie Mellon University Baker Hall 161 5000 Forbes Avenue, Pittsburgh, PA 15213, USA B fza[email protected] m francescazaorablando.com

Areas of Research

Areas of specialisation Logic; Formal Epistemology; Philosophy of Probability and Induction

Areas of teaching competence Philosophy of Science; Epistemology; Rational Choice, Decision Theory, and Game Theory; Philosophy of Logic and Mathematics

Employment

2020– Carnegie Mellon University Assistant Professor, Department of Philosophy

Education

2015–2020 Stanford University Ph.D., Philosophy and Symbolic Systems Dissertation: Patterns and Probabilities: A Study in Algorithmic Randomness and Com- putable Learning Committee: Johan van Benthem (advisor), Ray Briggs, Persi Diaconis, Thomas Icard, and Brian Skyrms 2014–2015 University of California, Irvine Ph.D. student, Logic and Philosophy of Science 2012–2015 University of Amsterdam, Institute for Logic, Language and Computation M.Sc., Logic (Track: Logic and Computation) Thesis: From von Mises’ Impossibility of a Gambling System to Probabilistic Martingales Advisors: Paul Vitányi and Michiel van Lambalgen

1 2008–2012 The University of Edinburgh M.A., Philosophy (undergraduate degree), First Class Honours Bruce of Grangehill Prize, for the best performance by an undergraduate student in any degrees administered by the Philosophy Department Thesis: Is Logic Rationally Revisable? Advisor: Paul Schweizer

Publications

Journal publications van Benthem, J., Mierzewski, K., and Zaora Blando, F. (2020). The Modal Logic of Stepwise Removal, The Review of Symbolic Logic. DOI: https://doi.org/10.1017/S1755020320000258.

Zaora Blando, F. (2019). A learning-theoretic characterisation of Martin-Löf randomness and Schnorr randomness, The Review of Symbolic Logic. DOI: https://doi.org/10.1017/S175502031900042X.

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

Zaora 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, University of Düsseldorf.

Forthcoming

Commissioned Genin, K., Lin, H., Sterkenburg, T., and Zaora Blando, F., Learning Theory. Commissioned by Oxford University Press for Oxford Bibliographies.

Edited collections Klein, D., Raee Rad, S., and Zaora Blando, F., Special Issue: Combining Logic and Probability, Annals of Pure and Applied Logic, forthcoming in 2022.

Under review

Zaora Blando, F., [Title redacted]. In this paper, I show that agreeing on which data streams are algorithmically random guarantees that two computable Bayesian agents beginning the learning process with dierent subjective priors will eventually reach a consensus.

2 In preparation (*drafts available upon request)

• Huttegger, S., Walsh, S., and Zaora Blando, F., Algorithmic randomness and Lévy’s Upward Theorem.* • Huttegger, S., Walsh, S., and Zaora Blando, F., Bayesian learning and algorithmic randomness. • Zaora Blando, F. and Mierzewski, K., Meta-induction and the selection problem.

Talks

Refereed 2021 Algorithmic randomness, Bayesian convergence and merging TARK 2021: The 18th Conference on Theoretical Aspects of Rationality and Knowledge, Tsinghua University, Beijing. 2021 Merging, polarisation and algorithmic randomness PROGIC 2021: The Tenth Workshop on Combining Probability and Logic, Munich Center for Mathematical Philosophy, Ludwig Maximilian University of Munich 2020 Algorithmic randomness and Bayesian merging of opinions (poster) Formal Epistemology Workshop 2020, University of California, Irvine 2018 Schnorr randomness and Lévy’s Upward Theorem CCR 2018: 13th International Conference on Computability, Complexity and Randomness, Universidad Andrés Bello, Santiago de Chile 2018 The Modal Logics of the Poison Game (joint talk with Krzysztof Mierzewski) AWPL 2018: 4th Asian Workshop on Philosophical Logic, Tsinghua University, Beijing 2016 The Learning Power of Belief-revision Policies for Non-omniscient Agents • Formal Epistemology Workshop 2016, University of Groningen • GIRLS16@LUND Conference, University of Lund 2013 The Emergence of Proto-Inference through the Dynamics of Evolution and Learning 25th European Summer School in Logic, Language and Information (ESSLLI 2013), Student Session, Univer- sity of Düsseldorf

Invited 2021 Weak merging of opinions for computationally limited agents • Logic and Interactive Rationality (LIRa) Seminar, Institute for Logic, Language and Computation, University of Amsterdam • LSE/Bristol/Michigan/Irvine Formal Rationality Forum 2020 Algorithmic randomness and Bayesian merging of opinions • Foundations of Probability Seminar, Rutgers University • Institute for Mathematical Behavioral Sciences Seminar, University of California, Irvine

3 • Workshop on the Foundations, Applications & Theory of Inductive Logic: Interdisciplinarity of Inductive Logic, Munich Center for Mathematical Philosophy, Ludwig Maximilian University of Munich 2020 Algorithmic randomness, convergence to the truth, and epistemic immodesty Formal Epistemology Reading Course (FERC), University of California, Berkeley 2020 Algorithmic randomness and Bayesian learning for computable agents • Colloquium, Philosophy Department, Carnegie Mellon University • Colloquium, Philosophy Department, University of Groningen 2019 Algorithmic randomness and Bayesian convergence to the truth • Logic Seminar, University of Melbourne • Colloquium, Philosophy Department, University of Groningen 2018 Algorithmic randomness, learning theory, and the foundations of probability Philosophy of Science, etc. (PoSe) Lecture, Philosophy Department, University of Michigan at Ann Arbor 2018 A learning-theoretic characterisation of Martin-Löf randomness • Berkeley-Stanford Circle in Logic and Philosophy, San Francisco • Topics in Scientic Philosophy Workshop, University of California, Irvine 2018 Algorithmic randomness and learning Colloquium, Logic and Philosophy of Science Department, University of California, Irvine 2016 Algorithmic randomness and computable learners • 5th CSLI Workshop on Logic, Rationality, and Intelligent Interaction, Center for the Study of Language and Information, Stanford University • Probability and Randomness Seminar, Logic and Philosophy of Science Department, University of California, Irvine 2015 The Learning Power of Explicit Belief Revision Topics in Logic, Information and Agency Seminar, Philosophy Department, Stanford University

Comments 2020 Comments on Snow Zhang and Alexander Meehan’s “Kolmogorov Conditionalizers Can Be Dutch Booked (If and Only If They Are ‘Evidentially Uncertain’)” Formal Epistemology Workshop 2020, University of California, Irvine 2018 Comments on Chloé de Canson’s “Salience and the Sure-Thing Principle” Athena in Action Workshop 2018, Princeton University 2018 Comments on Hanti Lin’s “Modes of Convergence to the Truth: Steps toward a Better Episte- mology of Induction” Formal Epistemology Workshop 2018, University of Toronto

4 Awards, Grants, and Honours

2019 German Research Foundation (DFG) Grant Collectively awarded to support the network on the the Foundations, Applications and Theory of Inductive Logic 2019 The Patrick Suppes Fellowship in Philosophy of Science, Stanford University 2018 NSF Travel Grant Awarded by the Organizing Committee of the 13th International Conference on Computability, Complexity and Randomness 2018 The Patrick Suppes Fellowship in Philosophy of Science, Stanford University 2014 Social Science Merit Fellowship, University of California, Irvine 2014 Graduate Dean’s Recruitment Fellowship, University of California, Irvine For admitted doctoral and M.F.A. students who have received competitive oers from other institutions 2012 Bruce of Grangehill Prize, The University of Edinburgh For the best performance by an undergraduate student in any degrees administered by the Philosophy Department 2012 Undergraduate Awards 2012 International winner, Philosophical Studies and Theology category for the paper Does Deduction really rest on a more secure epistemological footing than Induction?

Teaching

As primary instructor at Carnegie Mellon 2021 80-316: Logic and AI (Spring 2021) 2021 80-150: Nature of Reason (Spring 2021) 2020 80-517/80-817: Seminar on Topics in Logic: Algorithmic randomness and the Foundations of Probability (Fall 2020)

As teaching assistant at Stanford 2019 PHIL 49: Survey of Formal Methods (Spring 2019) Primary instructor: John Taylor Chipman 2018 PHIL 356C/CS 257: Logic and Articial Intelligence (Winter 2018) Primary instructor: Thomas Icard 2017 PHIL 154: Modal logic (Spring 2017) Primary instructor: Johan van Benthem 2017 PHIL 151: Metalogic (Winter 2017) Primary instructor: Peter Hawke 2016 PHIL 150: Introduction to Mathematical Logic (Fall 2016) Primary instructor: Thomas Icard

5 As teaching assistant at UC Irvine 2015 LPS 31: Introduction to Inductive Logic (Spring 2015) Primary instructor: Simon Huttegger

Service

Refereeing Mind, The Review of Symbolic Logic

Conference organisation 2021 8th International Conference on Logic, Rationality and Interaction (program committee) 2020 Formal Epistemology Workshop 2020 (program committee) 2018 7th CSLI Workshop on Logic, Rationality & Intelligent Interaction (organising committee) 2017 6th CSLI Workshop on Logic, Rationality & Intelligent Interaction (organising committee) 2016 5th CSLI Workshop on Logic, Rationality & Intelligent Interaction (organising committee)

Departmental service (Stanford University) 2019-2020 Logic and Formal Philosophy Seminar Coordinator 2016-2017 Mathematical Logic Seminar Coordinator 2016-2017 Professional Development Ocer, Stanford Philosophy graduate student association

Departmental service (Institute for Logic, Language and Computation, Amsterdam) 2013-2014 Student Mentor for rst-year Master of Logic students 2013-2014 Co-organiser of the Cool Logic Seminar

Ailiations

Association for Symbolic Logic

Languages

• Italian (native) • Latin (limited reading prociency) • French (advanced) • Ancient Greek (limited reading prociency) • Polish (beginner)

6 References

Johan van Benthem ([email protected]) University of Amsterdam, Stanford University, and Tsinghua University

Ray Briggs ([email protected]) Stanford University

Simon Huttegger ([email protected]) University of California, Irvine

Thomas Icard ([email protected]) Stanford University

Brian Skyrms ([email protected]) University of California, Irvine, and Stanford University

Sean Walsh ([email protected]) University of California, Los Angeles

7