Functional interpretations of feasibly constructive arithmetic
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Finitely stratified polymorphism
Information and Computation
A foundational delineation of poly-time
Papers presented at the IEEE symposium on Logic in computer science
A New Characterization of Type-2 Feasibility
SIAM Journal on Computing
A Note on the Relation Between Polynomial Time Functionals and Constable's Class K
CSL '95 Selected Papers from the9th International Workshop on Computer Science Logic
On the Computational Complexity of Type 2 Functionals
CSL '97 Selected Papers from the11th International Workshop on Computer Science Logic
Intrinsic Theories and Computational Complexity
LCC '94 Selected Papers from the International Workshop on Logical and Computational Complexity
Type two computational complexity
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
Intrinsic reasoning about functional programs II: unipolar induction and primitive-recursion
Theoretical Computer Science - Implicit computational complexity
Inductive and Coinductive Components of Corecursive Functions in Coq
Electronic Notes in Theoretical Computer Science (ENTCS)
Characterizations of the basic feasible functionals of finite type
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Polynomial and abstract subrecursive classes
Journal of Computer and System Sciences
Ramified Corecurrence and Logspace
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
Proof theoretic characterizations of complexity classes are of considerable interest because they link levels of conceptual abstraction to computational complexity. We consider here the provability of functions over co-inductive data in a highly expressive, yet proof-theoretically weak, variant of second order logic L+*, which we believe captures the notion of feasibility more broadly than previously considered pure-logic formalisms. Our main technical result is that every basic feasible functional (i.e. functional in the class BFF, believed to be the most adequate definition of feasibility for second-order functions) is provable in L+*.