The arithmetical hierarchy is a hierarchy of either (depending on the context) formulas or relations. The relations of a particular level of the hierarchy are exactly the relations defined by the formulas of that level, so the two uses are essentially the same.
The first level consists of formulas with only bounded quantifiers, the corresponding relations are also called the Primitive Recursive relations (this definition is equivalent to the definition from computer science). This level is called any of , and , depending on context.
A formula is if there is some formula such that can be written:
The relations are the same as the Recursively Enumerable relations.
Similarly, is a relation if there is some formula such that:
The relations in are the Recursive relations.
Higher levels on the hierarchy correspond to broader and broader classes of relations. A formula or relation which is (or, equivalently, ) for some integer is called arithmetical.
The superscript is often omitted when it is not necessary to distinguish from the analytic hierarchy.
Functions can be described as being in one of the levels of the hierarchy if the graph of the function is in that level.
|Date of creation||2013-03-22 12:55:11|
|Last modified on||2013-03-22 12:55:11|
|Last modified by||CWoo (3771)|