Nuprl Definition : satisfiable-integer-problem
satisfiable(eqs;ineqs) == ∃xs:ℤ List. satisfies-integer-problem(eqs;ineqs;xs)
Definitions occuring in Statement :
satisfies-integer-problem: satisfies-integer-problem(eqs;ineqs;xs),
list: T List,
exists: ∃x:A. B[x],
int: ℤ
Definitions occuring in definition :
exists: ∃x:A. B[x],
list: T List,
int: ℤ,
satisfies-integer-problem: satisfies-integer-problem(eqs;ineqs;xs)
FDL editor aliases :
satisfiable-integer-problem
Latex:
satisfiable(eqs;ineqs) == \mexists{}xs:\mBbbZ{} List. satisfies-integer-problem(eqs;ineqs;xs)
Date html generated:
2016_05_14-AM-07_11_39
Last ObjectModification:
2015_09_22-PM-05_53_14
Theory : omega
Home
Index