is mentioned by
[sfa_doc_nat_sqrt] | |
[sfa_doc_simple_existential_2] | |
Thm* (x:. f zero beyond x) & (x:. g zero beyond x) Thm* Thm* (x:. (i.if i even f(i) else g(i) fi) zero beyond x) | [sfa_doc_alternate_zero_beyond] |
[sfa_doc_or_dec] | |
Thm* P:((A List)Prop). Thm* (P(nil) Q) & (a:A, x:A List. P(a.x) R(a,x,P(x))) | [sfa_doc_listind_via_so] |
[sfa_doc_and_via_so] | |
[sfa_doc_and_typing] | |
[sfa_doc_cand_example] | |
[sfa_doc_indscheme] | |
Def == n = 1 & P(X) n2 & (X/a,rest. P(a) ( u in rest: A^(n-1). P(u))) Def (recursive) | [sfa_doc_ntuple_contains] |
[sfa_doc_exteq] |
In prior sections: core int 1 bool 1 int 2 rel 1 fun 1
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html