“Gödel's first incompleteness theorem states that any computably axiomatizable and consistent theory that includes a certain amount of arithmetic will be incomplete, meaning there will be statements it can neither prove nor refute.”