Self-reference
Named by 4 essays across one field — each of them below, with the objects they name alongside it.
The row that is not on the list
Write down a list of infinite sequences, any list at all, and there is a rule that builds a sequence missing from it. The rule reads one entry from each row, and it is the single most reused argument in this field.
A list that cannot contain itself
The set of all sets that do not contain themselves is not a set. The argument is the diagonal again, applied to a table whose rows and columns are the same objects, and it destroyed the foundations of mathematics in a postcard.
The sentence that says it has no proof
Number every sentence and every proof, and a formal system can talk about itself. Then the diagonal is available one more time, and what it builds is a sentence that is true exactly when it is unprovable.
Necessity that means provable
Read the box as "the theory proves" and one modal logic stops being a proposal about what necessity might mean. It becomes a complete description of what a formal system can prove about its own proofs — and its frames run forward, compose, and stop.
Named alongside it
The objects these essays reach for when they reach for this one.
Diagonal argumentConsistencyFixed pointFormal systemIncompletenessProvabilityArithmetisationBijectionCardinalityComprehensionCountabilityFrame