Nuprl Definition : unsat-int-problem
unsat(p) == ∀xs:ℤ List. (¬xs |= p)
Definitions occuring in Statement :
satisfies-int-constraint-problem: xs |= p,
list: T List,
all: ∀x:A. B[x],
not: ¬A,
int: ℤ
Definitions occuring in definition :
all: ∀x:A. B[x],
list: T List,
int: ℤ,
not: ¬A,
satisfies-int-constraint-problem: xs |= p
FDL editor aliases :
unsat-int-problem
Latex:
unsat(p) == \mforall{}xs:\mBbbZ{} List. (\mneg{}xs |= p)
Date html generated:
2016_05_14-AM-07_17_14
Last ObjectModification:
2015_09_22-PM-05_53_37
Theory : omega
Home
Index