Some definitions of interest.
fib	Def fib(n) == if n=0  n=1 1 else fib(n-1)+fib(n-2) fi  (recursive)
	Thm* n:. fib(n)
nat	Def  == {i:| 0i }
	Thm*   Type
not	Def A == A  False
	Thm* A:Prop. (A)  Prop

About: IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html