Example 1 — Powerful enough?
Show the steps and the answer
Write out the system, taking addition to wrap around as on a two-position switch: the axioms are , , , .
These four facts are the whole content of addition, so every statement is built from them.
Settle a sample statement: , so the system proves and refutes .
Any equation of 0s and 1s reduces to a single value by repeated use of the table.
Cover every equation: each side reduces to 0 or 1, leaving , (proved) or , (refuted). A statement such as 'for every , ' is settled by trying and .
For every sentence the system proves or proves , which is the definition of completeness.
Note why this worked: there are only two objects, so every question ends in a finite calculation.
Arithmetic on all whole numbers has infinitely many objects, and Gödel showed no consistent, checkable axioms for it can decide every statement.
Answer: Yes — it is complete (it decides every statement)
Takeaway: A system is complete when every statement it can express is either proved or refuted. Small systems can be checked by calculation; for whole-number arithmetic, no consistent, checkable set of axioms is complete.