Think of mathematics not as a collection of facts, but as a game. Like any game, it has a starting setup and a set of rules for how to play. A formal system is the rulebook for this kind of game. It's a framework built from a few core components: an alphabet of symbols, a set of starting statements called axioms, and rules of inference that tell you how to create new, valid statements from the existing ones.

The symbols are the game pieces. They might be numbers like '0' or '3', variables like 'x', or operators like '+' and '='. The axioms are the initial setup of the board. They are statements we accept as true without proof. They are the foundation of the entire system.

The rules of inference are the legal moves. They tell us how to combine our symbols and axioms to produce new, true statements. A new statement derived within the system is called a theorem. Every single theorem in the system is just a result of applying these rules over and over, starting from the axioms.

One of the most famous formal systems is Peano Arithmetic. Its goal is to formalize the world of natural numbers (0, 1, 2, 3, ...). Instead of taking addition and multiplication for granted, it tries to build them from a handful of incredibly simple ideas. It starts with the concept of '0' and a 'successor' function, which basically means 'the next number in line'.

The system is built on a few axioms. Let's write $S(n)$ for the successor of a number $n$. So, $S(0)$ is 1, $S(1)$ is 2, and so on. The core axioms of Peano Arithmetic can be stated in plain language:

From just these starting points and a few rules, you can prove every fact of basic arithmetic. You can define what 'addition' means by saying that adding zero doesn't change a number, and adding $S(n)$ is the same as finding the successor of adding $n$. You can then use that definition to prove that $1 + 1 = 2$. Every theorem, no matter how complex, is a chain of logical steps leading back to these simple axioms.

When mathematicians design a formal system, they hope it has two key properties: consistency and completeness. These are measures of how good and reliable the system is.

Consistency means the system is free from contradictions. You can't use the rules to prove a statement is true and also prove that it's false. If a system allowed you to prove that $2 + 2 = 4$ and also that $2 + 2 = 5$, it would be inconsistent and utterly useless. Everything would be provable, and the concept of 'truth' within the system would collapse.

Completeness is about the system's power. A formal system is complete if, for any statement you can make in its language, the system can either prove it true or prove it false. There are no gaps. If we ask, "Is 7 a prime number?" a complete system for arithmetic should be able to provide a definitive proof one way or the other.

For a long time, mathematicians hoped to create a single formal system for all of mathematics that was both consistent and complete. Such a system would be a perfect, self-contained engine for discovering all mathematical truth. But the quest for this perfect system would lead to a surprising and profound discovery about the very limits of logic itself.