Back to the index. Or to the chambers

This article has 12 links. View as Cloud or List.

Necessary And Sufficient Integer Terms And Formulas Class Complement Quantifier Relation Theory Tree Set Theoretic Completely Simple Semigroup Negation Superscript Analytic Hierarchy

Loading ...

Planetmath Browser (2008—2009)

BSD licence | A django site

All articles taken from PlanetMath.org snapshot under CC-BY-SA licence.

→ The original article on PlanetMath.org

Other Formats: LaTeX

New! You can click on formulas to copy the LaTeX source to your clipboard. | Math Videos

Arithmetical Hierarchy

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 $\Delta^0_0$ , $\Sigma^0_0$ and $\Pi^0_0$ , depending on context.

A formula $\phi$ is $\Sigma^0_n$ if there is some $\Delta^0_0$ formula $\psi$ such that $\phi$ can be written:

$\displaystyle \phi(\vec k)=\exists x_1\forall x_2\cdots {Q}x_n\psi(\vec k,\vec x)$

where $\displaystyle Q$ is either $\displaystyle \forall$ or $\displaystyle \exists$ , whichever maintains the pattern of alternating quantifiers

The $\Sigma^0_1$ relations are the same as the Recursively Enumerable relations.

Similarly, $\phi$ is a $\Pi^0_n$ relation if there is some $\Delta^0_0$ formula $\psi$ such that:

$\displaystyle \phi(\vec k)=\forall x_1\exists x_2\cdots Q x_n\psi(\vec k,\vec x)$

where $\displaystyle Q$ is either $\displaystyle \forall$ or $\displaystyle \exists$ , whichever maintains the pattern of alternating quantifiers

A formula is $\Delta^0_n$ if it is both $\Sigma^0_n$ and $\Pi^0_n$ . Since each $\Sigma^0_n$ formula is just the negation of a $\Pi^0_n$ formula and vice-versa, the $\Sigma^0_n$ relations are the complements of the $\Pi^0_n$ relations.

The relations in $\Delta^0_1 = \Sigma^0_1 \cap \Pi^0_1$ are the Recursive relations.

Higher levels on the hierarchy correspond to broader and broader classes of relations. A formula or relation which is $\Sigma^0_n$ (or, equivalently, $\Pi^0_n$ ) for some integer is called arithmetical.

The superscript 0 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.

1	Complement
1	Class
1	Tree Set Theoretic
1	Terms And Formulas
1	Integer
1	Relation Theory
1	Necessary And Sufficient
1	Quantifier
2	Negation
2	Completely Simple Semigroup
4	Superscript
12	Analytic Hierarchy