Generic Godel''s incompleteness theorem
Goodel's incompleteness theorem asserts that if formal arithmetic is consistent then there exists an arithmetic statement such that neither the statement nor its negation can be derived from the axioms of formal arithmetic. Previously [Sib. El. Mat. Izv., 12 (2015), 185-189], it was proved that formal arithmetic remains incomplete if, instead of the set of all arithmetic statements, we consider any set of some class of "almost all" statements (a class of so-called strongly generic subsets). This result is strengthened as follows: formal arithmetic is incomplete for any generic subset of arithmetic statements (i.e., a subset of asymptotic density 1).