--- a/Pearl-jv/document/root.tex	Tue Oct 12 13:06:18 2010 +0100
+++ b/Pearl-jv/document/root.tex	Wed Oct 13 22:55:58 2010 +0100
@@ -37,8 +37,8 @@
 unified atom type and that represents permutations by bijective functions from
 atoms to atoms. Interestingly, we allow swappings, which are permutations
 build from two atoms, to be ill-sorted.  Furthermore we extend the nominal
-logic work with names that carry additional information and with abstractions
-that bind finite sets of names.
+logic work with names that carry additional information and with a
+formalisation of abstractions that bind finite sets of names.
 \end{abstract}
 
 % generated text of all theories