Kleene hierarchy

Kleene hierarchy
Name	Kleene hierarchy
Field	Mathematical logic
Introduced	1950s
Notable	Stephen Kleene

Kleene hierarchy The Kleene hierarchy classifies sets and relations of natural numbers by definability and complexity in formal systems, particularly in recursion theory and descriptive set theory. It organizes pointclasses into levels reflecting quantifier alternations and computability constraints, connecting to work by Stephen Kleene, Alonzo Church, Kurt Gödel, Alan Turing, and Emil Post. The hierarchy interfaces with results from Henkin construction, Gödel's completeness theorem, Tarski's undefinability theorem, Post's problem, and methods used in Hilbert's program.

Introduction

The hierarchy arises in studies of effective definability and degrees of unsolvability, relating to the Lambda calculus, Turing machine, Partial recursive function, Recursive enumerability, and notions formalized by Kurt Gödel and Alonzo Church. It provides a stratified view much like the classifications in the Arithmetical hierarchy and the Analytical hierarchy, while influencing later work by Emil Post, Solomon Feferman, and Harvey Friedman. Connections reach to constructivist programs of Bishop foundation and to proof-theoretic analyses used by Gerhard Gentzen.

Definitions and Notation

Definitions use formal languages and coding devices familiar from treatments by Stephen Kleene and expositions in texts by Julian Barbour and S. C. Kleene (see original papers). Basic notation encodes finite sequences, Gödel numbers, and partial recursive predicates using standards introduced in writings by Alonzo Church, Alan Turing, Kurt Gödel, Alfred Tarski, and implemented in proofs by Stephen Cole Kleene. Pointclasses are named with symbols akin to Σ, Π annotated by indices; quantifier alternation counted in the style of work by Emil Post and Raymond Smullyan. Constructions rely on universal machines from Alan Turing and on recursion theorem techniques attributed to Stephen Kleene and Emil Post.

Levels and Properties of the Hierarchy

Each level in the hierarchy corresponds to a class of predicates or sets defined by bounded alternations of existential and universal number quantifiers, following schema used by Kurt Gödel in arithmetization and by Alonzo Church in lambda-definability. Properties include closure under effective reductions studied by Emil Post and degrees characterized in the spirit of Turing degrees and Many-one reductions. Completeness results mirror methods from Kurt Gödel's incompleteness phenomena and reductions inspired by Alan Turing and Alonzo Church. Key structural features were explored by Stephen Kleene, Solomon Feferman, and Gerald Sacks in relation to recursion-theoretic notions developed by R. M. Robinson and J. Barkley Rosser.

Relationship to Arithmetical and Analytical Hierarchies

The Kleene hierarchy refines and interacts with the Arithmetical hierarchy and the Analytical hierarchy as developed by Kurt Gödel, Stephen Kleene, and Solomon Feferman. Results linking these frameworks use methods from Proof theory originating with Gerhard Gentzen and model constructions like those in Henkin construction and Skolemization originating with Thoralf Skolem. Effective descriptive set-theoretic correspondences draw on work by Wacław Sierpiński, Felix Hausdorff, and André Weil in related classification problems, while recursion-theoretic embeddings employ techniques by Richard Shore and Carl Jockusch.

Applications and Examples

Applications occur in classifying decision problems such as those arising in the theories of Peano arithmetic, Presburger arithmetic, and formal systems considered by Alonzo Church and Alan Turing. Concrete examples include canonical complete sets for levels analogous to those constructed by Emil Post and completeness proofs using diagonalization as in Kurt Gödel's incompleteness arguments. The hierarchy also informs work on degrees of unsolvability studied by Dana Scott, Richard Shore, and Robert Soare, and it appears in investigations of definability in models examined by Alfred Tarski and Thoralf Skolem.

Historical Development and Contributors

Foundational contributions came from Stephen Kleene whose papers and monographs codified the stratification, building on earlier formal notions by Alonzo Church, Alan Turing, and Kurt Gödel. Subsequent development involved Emil Post, Solomon Feferman, Gerald Sacks, Robert Soare, Richard Shore, and Carl Jockusch who expanded connections with recursion theory, degrees, and descriptive set theory. Influential problems and methods trace to David Hilbert's program, critiques by Ludwig Wittgenstein, and later formal analyses by Gerhard Gentzen and Henri Poincaré.

Category:Computability theory