Nuprl Definition : satisfiable_int_formula
satisfiable_int_formula(fmla) == ∃f:ℤ ⟶ ℤ. int_formula_prop(f;fmla)
Definitions occuring in Statement :
int_formula_prop: int_formula_prop(f;fmla),
exists: ∃x:A. B[x],
function: x:A ⟶ B[x],
int: ℤ
Definitions occuring in definition :
exists: ∃x:A. B[x],
function: x:A ⟶ B[x],
int: ℤ,
int_formula_prop: int_formula_prop(f;fmla)
FDL editor aliases :
satisfiable_int_formula
Latex:
satisfiable\_int\_formula(fmla) == \mexists{}f:\mBbbZ{} {}\mrightarrow{} \mBbbZ{}. int\_formula\_prop(f;fmla)
Date html generated:
2016_05_14-AM-07_07_43
Last ObjectModification:
2015_09_22-PM-05_52_48
Theory : omega
Home
Index