User:Fairflow

From Wikipedia, the free encyclopedia

I guess I should have a user page. This is it. My main interests and/or experience are in the areas of:

My PhD[1] is in proof theory, on the borders of mathematical logic and computation and my research experience is in computer assisted formal reasoning, constructive modal logic (in particular, Lax logic) and, more generally formal verification. I developed a scholarly interest in process calculus from meeting Robin Milner's ideas as a young(ish) research assistant at Edinburgh's Laboratory for Foundations of Computer Science. But now I tutor a course on Mathematical methods and models with the Open University. And grow stuff.

This user can read Fraktur.

Fairflow (talk) 19:20, 8 October 2011 (UTC)

References[edit]

  1. ^ Fairtlough, Matthew (1992). "Ordinal Complexity of Recursive Programs and their Termination Proofs". The University of Edinburgh.