A Proof-Theoretic Characterization of the Basic Feasible Functionals

A Proof-Theoretic Characterization of the Basic Feasible Functionals (2002)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Thomas Strahm

Venue:	Theoretical Computer Science
Citations:	6 - 5 self

BibTeX

@TECHREPORT{Strahm02aproof-theoretic,
    author = {Thomas Strahm},
    title = {A Proof-Theoretic Characterization of the Basic Feasible Functionals},
    institution = {Theoretical Computer Science},
    year = {2002}
}

Bookmark

OpenURL

Abstract

We provide a natural characterization of the type two Mehlhorn-CookUrquhart basic feasible functionals as the provably total type two functionals of our (classical) applicative theory PT introduced in [27], thus providing a proof of a result claimed in the conclusion of [27].

Citations

158	A new recursion-theoretic characterization of the poly-time functions - Bellantoni, Cook - 1992
106	Bounded Arithmetic. Bibliopolis - Buss - 1986
93	Introduction to Combinators and λ-Calculus - Hindley, Seldin - 1986
87	A language and axioms for explicit mathematics - Feferman
79	Functional interpretations of feasibly constructive arithmetic - Cook, Urquhart - 1993
67	Foundations of Constructive Mathematics: Metamathematical Studies, Ergebnisse der Mathematik und ihrer Grenzgebiete - Beeson - 1985
62	Constructive theories of functions and classes - Feferman - 1979
53	Ramified recurrence and computational complexity I: Word recurrence and polytime - Leivant - 1992
35	A new characterization of type-2 feasibility - Kapron, Cook - 1996
31	Computation models and function algebras - Clote - 1999
27	Characterizations of the basic feasible functions of finite type - Cook, Kapron - 1990
27	A foundational delineation of poly-time - Leivant - 1994
20	Proving programs and programming proofs - Beeson - 1986
20	Polynomial time computable arithmetic and conservative extensions - Ferreira - 1988
17	Complexity theory of higher type functionals - Seth - 1994
16	Higher type recursion, ramification and polynomial time - Bellantoni, Niggl, et al.
15	Type systems for polynomial-time computation, Habilitation thesis - Hofmann - 1999
14	B.M.: On characterizations of the basic feasible functionals - Irwin, Royer, et al. - 2001
14	Predicative recurrence in finite type - Leivant - 1994
11	combinatory logic and positive safe induction - Cantini
11	Theories with self-application and computational complexity - Strahm
10	and uniformity in weak applicative theories - Cantini
10	Semantics vs. syntax vs. computations: Machine models for type-2 polynomial-time bounded functionals - Royer - 1997
9	Proof Theory and Logical Complexitiy - Girard - 1987
7	The Lambda Calculus, revised ed - Barendregt - 1985
7	and Abstract Subrecursive Classes - Melhorn, “Polynomial - 1976
6	Polynomial time computable arithmetic. In Logic and Computation, Proceedings of a Workshop held at - Ferreira - 1987
4	Proof-theoretic Contributions to Explicit Mathematics - Strahm - 2001
3	On the computational complexity of type 2 functionals - Pezzoli - 1998
2	Implicit computational complexity for higher type functionals - Leivant - 2002