Systems of Logic Based on Ordinals

Systems of Logic Based on Ordinals was the PhD dissertation of the mathematician Alan Turing.

[1][2] Turing's thesis is not about a new type of formal logic, nor was he interested in so-called "ranked logic" systems derived from ordinal or relative numbering, in which comparisons can be made between truth-states on the basis of relative veracity.

Instead, Turing investigated the possibility of resolving the Gödelian incompleteness condition using Cantor's method of infinites.

Turing's thesis looks at what happens if you simply iterate this process repeatedly, generating an infinite set of new axioms to add to the original theory, and even goes one step further in using transfinite recursion to go "past infinity", yielding a set of new theories Gα, one for each ordinal number α.

The thesis was completed at Princeton under Alonzo Church and was a classic work in mathematics that introduced the concept of ordinal logic.