Arithmetic hierarchy (Sigma_n / Pi_n)

Layer 0 — Mathematicsin the recursion-theory subtree

Kleene-Mostowski 1943-1947 arithmetic hierarchy: Sigma_n = exists-then-bounded-quantifiers; Pi_n = forall-then-bounded; Halting = Sigma_1; Tot = Pi_2; Cof = Sigma_3; etc.

Related concepts

Gödel's completeness theorem

Explore Arithmetic hierarchy (Sigma_n / Pi_n) on the interactive knowledge graph →