Theories with self-application and computational complexity

  • Authors:

  • Thomas Strahm

  • Affiliations:

  • Institut für Informatik und angewandte Mathematik (IAM), Universität Bern, Fachgruppe für theoretische Informatik und Logik (TIL), Neubrückstrasse 10, #316, CH-3012 Bern, Switz ...

  • Venue:
  • Information and Computation
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

Applicative theories form the basis of Feferman's systems of explicit mathematics, which have been introduced in the 1970s. In an applicative universe, all individuals may be thought of as operations, which can freely be applied to each other: self-application is meaningful, but not necessarily total. It has turned out that theories with self-application provide a natural setting for studying notions of abstract computability, especially from a proof-theoretic perspective. This paper is concerned with the study of (unramified) bounded applicative theories which have a strong relationship to classes of computational complexity. We propose new applicative systems whose provably total functions coincide with the functions computable in polynomial time, polynomial space, polynomial time and linear space, as well as linear space. Our theories can be regarded as applicative analogues of traditional systems of bounded arithmetic. We are also interested in higher-type features of our systems; in particular, it is shown that Cook and Urquhart's system PVω is directly contained in a natural applicative theory of polynomial strength.