Function operators spanning the arithmetical and the polynomial hierarchy

  title={Function operators spanning the arithmetical and the polynomial hierarchy},
  author={Armin Hemmerling},
  journal={RAIRO Theor. Informatics Appl.},
  • A. Hemmerling
  • Published 1 July 2010
  • Mathematics
  • RAIRO Theor. Informatics Appl.
A modified version of the classical μ-operator as well as the first value operator and the operator of inverting unary functions, applied in combination with the composition of functions and starting from the primitive recursive functions, generate all arithmetically representable functions. Moreover, the nesting levels of these operators are closely related to the stratification of the arithmetical hierarchy. The same is shown for some further function operators known from computability and… 


Hierarchies of function classes defined by the first-value operator
The first-value operator is applied to establish hierarchies of classes of functions under various settings to obtain a hierarchy connected with Ershov's one within Δ 0 2 and Hausdorff's difference hierarchy in the Borel class.
The Hausdorff-Ershov Hierarchy in Euclidean Spaces
The Hausdorff-Ershov hierarchy runs properly over all constructive ordinals, in contrast to Ershov's hierarchy whose denotation-independent version collapses at level ω2.
The Boolean Hierarchy I: Structural Properties
The complexity of sets formed by boolean operations (union, intersection, and complement) on NP sets are studied, showing that in some relativized worlds the boolean hierarchy is infinite, and that for every k there is a relativization world in which the Boolean hierarchy extends exactly k levels.
General recursive functions
where the symbol on the right denotes the smallest y such that A (X, y) = 0, under the assumption that there is such a y for each g. Kleene showed that this definition of general recursive function
A Taxonomy of Complexity Classes of Functions
  • A. Selman
  • Mathematics
    J. Comput. Syst. Sci.
  • 1994
This chapter explores the limits of mechanical computation as defined by Turing machines and Chomsky’s hierarchy of formal grammars, and describes the schemes of primitive recursion and μ-recursion, which enable a concise, mathematical description of computable functions that is independent of any machine model.
Recursively enumerable sets and degrees
TABLE OF CONTENTS Introduction Chapter I. The relation of the structure of an r.e. set to its degree. 1. Post's program and simple sets. 2. Dominating functions and quotient lattices. 3. Maximal sets
Ranking Primitive Recursions: The Low Grzegorczyk Classes Revisited
Traditional results in subrecursion theory are integrated with the recent work in "predicative recursion" by defining a simple ranking $\rho$ of all primitive recursive functions, which coincides with the Grzegorczyk hierarchy at and above the linear-space level.
Computers and Intractability: A Guide to the Theory of NP-Completeness
Horn formulae play a prominent role in artificial intelligence and logic programming. In this paper we investigate the problem of optimal compression of propositional Horn production rule knowledge
Degrees of unsolvability
In [4], Kleene and Post showed that there are degrees between 0' and 0' (the highest degree of recursively enumerable sets) and the existence of such degrees follows from the following theorem: if a > 0', then the degrees < a cannot be enumerated by a function of degree < a.