Some definitions of interest.
decidable	Def Dec(P) == P  P
	Thm* A:Prop. Dec(A)  Prop
finite-type	Def finite-type(T) == n:, f:(nT). Surj(n; T; f)
int_seg	Def {i..j} == {k:| i  k < j }
	Thm* m,n:. {m..n}  Type
surject	Def Surj(A; B; f) == b:B. a:A. f(a) = b
	Thm* A,B:Type, f:(AB). Surj(A; B; f)  Prop

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