Def f^n == primrec(n;x.x;i,g. f o g)

is mentioned by

Thm* R:(Id), in,out:(|R|IdLnk), i,j:|R|. Thm* ring(R;in;out) Thm*  Thm* x.n(x)^d(i;j)(i) = j & (k:. k<d(i;j)  x.n(x)^k(i) = j)	[rdist-property]
Def d(i;j) == mu(k.x.n(x)^k+1(i) = j)+1	[rdist]
Def ring(R;in;out) Def == (i:|R|.  Def == ((R(source(in(i)))) & (R(destination(out(i)))) Def == (& source(out(i)) = i Def == (& & destination(in(i)) = i Def == (& & in(destination(out(i))) = out(i)  IdLnk Def == (& & out(source(in(i))) = in(i)  IdLnk) Def == & (i,j:|R|. k:. x.destination(out(x))^k(i) = j  Id) Def == & |R|	[ring]

In prior sections: mb nat mb event system 1

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