In mathematical logic , PERSON@1 's incompleteness theorems , proved by PERSON@2 in NUMBER@1 , are two theorems stating inherent limitations of all but the most trivial formal systems for arithmetic of mathematical interest .

They are about limitations in all but the most trivial formal systems for arithmetic of mathematical interest .
