Def exp(m;n) == if n=0 then 1 else mexp(m;n-1) fi   (recursive)

is mentioned by

Thm* n,m:. exp(m+1+1;n)<exp(m+1+1;n+1)	[less_exp_suc_mono]
Thm* m,n:. 0<exp(n+1;m)	[zero_less_exp]
Thm* m,n:. exp(n+1;m) = 0	[not_exp_0]

In prior sections: hol arithmetic 1 hol arithmetic 4

Try larger context: HOLlib IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html