Next: Expanding Mathematics Up: matharth Previous: Truth

The hierarchy of mathematical truth

The Arithmetical and Analytical Hierarchies classify sets of integers based on the number of alternating quantifiers over the integers (arithmetical) and reals (analytical) in the statement that defines the set. For statements in the Arithmetical Hierarchy it is straight forward to enumerate all the finite events that determine if the statement is true or false. For a low level in the analytical hierarchy () we can also do this. (A statement is if it has a single pair of alternating quantifiers on the reals that begins with .)

Let be some Gödel numbering of TMs (Turing Machines) such that each TM accepts an integer input and after that may output an integer value. If a nonzero integer value is output it is interpreted as the Gödel number of a TM that has the same property of accepting an integer input and perhaps having a subsequent integer output. We define a path as an arbitrary sequence of integers. is the value output from when evaluated on the first elements of . may be undefined because may terminate before we get to level or because there is no output at that level.

Let be the set of all infinite sequences of integers and be the set of all integers. We say that is well founded iff the following holds.

This says that every path terminates in some finite number of steps.

The set of all well founded TMs is complete[2, p 396]. This means from this set we can recursively compute any set of integers.

We are able to enumerate all the events that determine if a TM is well founded. Those events are the where ranges over all integer sequences of length and ranges over all integers. Even though the set of well founded Turing Machines requires quantification over the reals to define it is an objective property of integers under Creative Objectivism.