Polynomial Analogue of Gandy’s Fixed Point Theorem

Abstract

The paper suggests a general method for proving the fact whether a certain set is p-computable or not. The method is based on a polynomial analogue of the classical Gandy’s fixed point theorem. Classical Gandy’s theorem deals with the extension of a predicate through a special operator ΓΦ(x)Ω∗ and states that the smallest fixed point of this operator is a Σ-set. Our work uses a new type of operator which extends predicates so that the smallest fixed point remains a p-computable set. Moreover, if in the classical Gandy’s fixed point theorem, the special Σ-formula Φ(x¯) is used in the construction of the operator, then a new operator uses special generating families of formulas instead of a single formula. This work opens up broad prospects for the application of the polynomial analogue of Gandy’s theorem in the construction of new types of terms and formulas, in the construction of new data types and programs of polynomial computational complexity in Turing complete languages.

Keywords

• polynomial computability
• p-computability
• Gandy’s fixed point theorem
• semantic programming
• polynomial operators
• Δ0p%22%2C%22default_operator%22%3A%22AND%22%7D%7D%7D"> <inline-formula><math display="inline"><semantics><msubsup><mo>Δ</mo><mn>0</mn><mi>p</mi></msubsup></semantics></math></inline-formula>