Systems of Logic Based on Ordinals

Nowadays, Systems of Logic Based on Ordinals is a topic that has captured the attention of many people around the world. From its origin to its impact on today's society, Systems of Logic Based on Ordinals has played an important role in people's lives. In this article, we will thoroughly explore the different aspects and perspectives related to Systems of Logic Based on Ordinals, analyzing its effects in various areas. From its influence on popular culture to its relevance in past, present and future history, we will dive into a detailed analysis of Systems of Logic Based on Ordinals and its role in today's world. With a critical and reflective look, we will examine the different implications and consequences of Systems of Logic Based on Ordinals, trying to better understand its impact on current society and in the future.

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.

The thesis is an exploration of formal mathematical systems after Gödel's theorem. Gödel showed that for any formal system S powerful enough to represent arithmetic, there is a theorem G that is true but the system is unable to prove. G could be added as an additional axiom to the system in place of a proof. However this would create a new system S' with its own unprovable true theorem G', and so on. 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.[3]

Martin Davis states that although Turing's use of a computing oracle is not a major focus of the dissertation, it has proven to be highly influential in theoretical computer science, e.g. in the polynomial-time hierarchy.[4]

References

  1. ^ Turing, Alan (1938). Systems of Logic Based on Ordinals (PhD thesis). Princeton University. doi:10.1112/plms/s2-45.1.161. hdl:21.11116/0000-0001-91CE-3. ProQuest 301792588.
  2. ^ Turing, A. M. (1939). "Systems of Logic Based on Ordinals". Proceedings of the London Mathematical Society: 161–228. doi:10.1112/plms/s2-45.1.161. hdl:21.11116/0000-0001-91CE-3.
  3. ^ Solomon Feferman, Turing in the Land of O(z) in "The universal Turing machine: a half-century survey" by Rolf Herken 1995 ISBN 3-211-82637-8 page 111
  4. ^ Martin Davis "Computability, Computation and the Real World", in Imagination and Rigor edited by Settimo Termini 2006 ISBN 88-470-0320-2 pages 63-66
Stub icon

This mathematical logic-related article is a stub. You can help Wikipedia by expanding it.

Stub icon

This article about a mathematical publication is a stub. You can help Wikipedia by expanding it.

Wikious
Boobota
Sagapedia