--- a/Paper/document/root.tex	Fri Apr 05 09:18:17 2013 +0100
+++ b/Paper/document/root.tex	Mon Apr 22 08:26:16 2013 +0100
@@ -49,7 +49,7 @@
 
 
 \begin{abstract}
-We present a formalised theory of computability in the theorem prover
+We formalise results from computability theory in the theorem prover
 Isabelle/HOL. 
 %This theorem prover is based on classical logic which
 %precludes \emph{direct} reasoning about computability: every boolean