Omega-Consistency

A strengthening of syntactic consistency for formal theories in arithmetic: a theory T is omega-consistent if there is no formula φ(x) such that T proves every numeral instance φ(0), φ(1), φ(2), ... and simultaneously T proves ∃x ¬φ(x) (equivalently T proves ¬∀x φ(x)).