Nuprl Definition : p-disjoint
p-disjoint(A;f;g) ==  ∀x:A. (¬((↑can-apply(f;x)) ∧ (↑can-apply(g;x))))
Definitions occuring in Statement : 
can-apply: can-apply(f;x)
, 
assert: ↑b
, 
all: ∀x:A. B[x]
, 
not: ¬A
, 
and: P ∧ Q
Definitions occuring in definition : 
all: ∀x:A. B[x]
, 
not: ¬A
, 
and: P ∧ Q
, 
assert: ↑b
, 
can-apply: can-apply(f;x)
FDL editor aliases : 
p-disjoint
Latex:
p-disjoint(A;f;g)  ==    \mforall{}x:A.  (\mneg{}((\muparrow{}can-apply(f;x))  \mwedge{}  (\muparrow{}can-apply(g;x))))
Date html generated:
2016_05_15-PM-03_45_35
Last ObjectModification:
2015_09_23-AM-07_44_37
Theory : general
Home
Index