Bahareh Afshari
Interests
My research explores the interface of mathematics and computer science by uncovering the subtle interactions between expressibility, complexity, and deductive strength in fixpoint logics. I employ techniques from proof theory and automata theory, notably cutelimination and tableaux, to gain insight into the behaviour of fixpoint constructions. In particular, I am interested in the analysis of the modal µcalculus and its fragments.
Biography
Bahareh Afshari holds a PhD in Mathematics from the University of Leeds. Her doctoral dissertation looks at the prooftheoretic strength of theories of inductive definitions, reverse mathematics of wellordering principles and characterisations of Turing degrees in the Ershov difference hierarchy.
In 2009, Afshari became an EPSRC research fellow at the Laboratory for Foundations of Computer Science at the University of Edinburgh working on decidability and complexity questions in modal µcalculus as part of the research team led by Julian Bradfield on the project Solving Parity Games and MuCalculi.
In 2011, she joined the Oxford Department of Computer Science as a research visitor, and later in 2012 as a research assistant, where she has continued her research on fixpoint logics working with Luke Ong and his research group. She is also an associate member of Wolfson College.
Selected Publications

On closure ordinals for the modal mu−calculus
Bahareh Afshari and Graham E. Leigh
In Simona Ronchi Della Rocca, editor, Computer Science Logic 2013 (CSL 2013). Vol. 23 of Leibniz International Proceedings in Informatics (LIPIcs). Pages 30–44. Dagstuhl‚ Germany. 2013. Schloss Dagstuhl–Leibniz−Zentrum fuer Informatik.
Details about On closure ordinals for the modal mu−calculus  BibTeX data for On closure ordinals for the modal mu−calculus  Download (pdf) of On closure ordinals for the modal mu−calculus  DOI (10.4230/LIPIcs.CSL.2013.30)

Ordinal analysis and the infinite Ramsey theorem
Bahareh Afshari and Michael Rathjen
In A. Dawar S.B. Cooper and B. Löwe, editors, CiE. Vol. 7318 of Lecture Notes in Computer Science. Pages 1–10. Springer. 2012.
Details about Ordinal analysis and the infinite Ramsey theorem  BibTeX data for Ordinal analysis and the infinite Ramsey theorem  Download (pdf) of Ordinal analysis and the infinite Ramsey theorem  DOI (10.1007/9783642308703_1)

A note on the theory of positive induction‚ ID*1
Bahareh Afshari and Michael Rathjen
In Archive for Mathematical Logic. Vol. 49. No. 2. Pages 275–281. 2010.
Details about A note on the theory of positive induction‚ ID*1  BibTeX data for A note on the theory of positive induction‚ ID*1  Download (pdf) of A note on the theory of positive induction‚ ID*1  DOI (10.1007/s0015300901689)