changeset 3106 5396e99c02af
parent 3103 98af809fee46
child 3485 f27a30a18a17
--- a/doc-src/Intro/foundations.tex	Mon May 05 18:09:31 1997 +0200
+++ b/doc-src/Intro/foundations.tex	Mon May 05 18:50:26 1997 +0200
@@ -1,4 +1,5 @@
 %% $Id$
 The following sections discuss Isabelle's logical foundations in detail:
 representing logical syntax in the typed $\lambda$-calculus; expressing
@@ -642,8 +643,8 @@
 Resolution expects the rules to have no outer quantifiers~($\Forall$).
 It may rename or instantiate any schematic variables, but leaves free
 variables unchanged.  When constructing a theory, Isabelle puts the
-rules into a standard form containing only schematic variables;
-for instance, $({\imp}E)$ becomes
+rules into a standard form with all free variables converted into
+schematic ones; for instance, $({\imp}E)$ becomes
 \[ \List{\Var{P}\imp \Var{Q}; \Var{P}}  \Imp \Var{Q}. 
 When resolving two rules, the unknowns in the first rule are renamed, by