WhoCites Definitions HOLlib Sections NuprlLIB Doc
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
Who Cites hodd?
hoddDef odd == n:. odd(n)
Thm* odd  (hnum  hbool)
oddDef odd(n) == if n=0 then false else odd(n-1) fi   (recursive)
Thm* n:. odd(n 
natDef  == {i:| 0i }
Thm*   Type
Thm*   S
tlambdaDef (x:Tb(x))(x) == b(x)
bnotDef b == if b false else true fi
Thm* b:b  
eq_intDef i=j == if i=j true ; false fi
Thm* i,j:. (i=j 
bifDef bif(bbx.x(bx); by.y(by)) == if b x(*) else y(x.x) fi
Thm* A:Type, b:x:(bA), y:((b)A). bif(bbx.x(bx); by.y(by))  A
leDef AB == B<A
Thm* i,j:. (ij Prop
notDef A == A  False
Thm* A:Prop. (A Prop

Syntax:odd has structure: hodd

About:
boolbfalsebtrueifthenelseassertintnatural_numbersubtract
int_eqless_thansetlambdaapplyfunction
recursive_def_noticeuniverseaxiommemberpropimpliesfalseall
!abstraction
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html

WhoCites Definitions HOLlib Sections NuprlLIB Doc