Modify this paragraph to be less difficult to understand:
In mathematical logic, Godel's incompleteness theorems, proved by Kurt Godel in 1931, 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.