is mentioned by
[sfa_doc_type_poly_mem_const] | |
[sfa_doc_inlist_singleton_const] | |
[sfa_doc_bool_vs_decidable_fun] | |
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* (n:. f(n) = 0) Thm* Thm* (n:. if f(n)=0 False else C:Prop{1}. C fi) Prop{1} | [sfa_doc_predicativity_sample8] |
[sfa_doc_equal_via_so] | |
[sfa_doc_some_via_so] | |
[sfa_doc_iff_via_so] | |
[sfa_doc_not_via_so] | |
[sfa_doc_or_via_so] | |
[sfa_doc_and_via_so] | |
[sfa_doc_imp_typing] | |
[sfa_doc_sexpr_atom_wf] | |
[sfa_doc_sexprcdrsize] | |
[sfa_doc_sexprcarsize] | |
[sfa_doc_ntuple_is_prod] | |
[sfa_doc_cand_example] | |
[kleene_minimize_is_lb] | |
[kleene_tail] | |
[sfa_doc_props_as_types_example1] | |
[sfa_doc_le_parm_sample_def] | |
[sfa_doc_indscheme] |
In prior sections: core well fnd int 1 bool 1 rel 1 union fun 1 int 2 list 1 sqequal 1
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html