Original: In mathematical logic , Gödel 's incompleteness theorems , proved by Kurt Gödel in 1931 , are two theorems stating inherent limitations of all but the most trivial formal systems for arithmetic of mathematical interest .
Simplified: They are about limitations in all but the most trivial formal systems for arithmetic of mathematical interest .