University of Oxford Logo University of OxfordDepartment of Computer Science - Home
On Facebook
Facebook
Follow us on twitter
Twitter
Linked in
Linked in
Flickr
Flickr
Google plus
Google plus
Digg
Digg
Pinterest
Pinterest
Stumble Upon
Stumble Upon

Bahareh Afshari : Publications

By dateBy titleBy typeBibtex

[1]

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.

[2]

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.

[3]

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.

[4]

Reverse mathematics and well−ordering principles: A pilot study

Bahareh Afshari and Michael Rathjen

In Annals of Pure and Applied Logic. Vol. 160. No. 3. Pages 231–237. 2009.

[5]

Relative computability and the proof−theoretic strength of some theories

Bahareh Afshari

PhD Thesis School of Mathematics‚ University of Leeds. 2008.

[6]

Post's programme for the Ershov hierarchy

Bahareh Afshari‚ George Barmpalias‚ S. Barry Cooper and Frank Stephan

In Journal of Logic and Computation. Vol. 17. No. 6. Pages 1025–1040. 2007.

[7]

Immunity Properties and the n−C.E. Hierarchy

Bahareh Afshari‚ George Barmpalias and S. Barry Cooper

In Jin−yi Cai‚ S. Barry Cooper and Angsheng Li, editors, TAMC. Vol. 3959 of Lecture Notes in Computer Science. Pages 694−703. Springer. 2006.