Some applications of logic to feasibility in higher types

Details Some applications of logic to feasibility in higher types Some applications of logic to feasibility in higher types

2002-04-22

arxiv.org/abs/cs/0204045v1

Computer Science

Logic in Computer Science

Scientific paper

In this paper we demonstrate that the class of basic feasible functionals has recursion theoretic properties which naturally generalize the corresponding properties of the class of feasible functions. We also improve the Kapron - Cook result on mashine representation of basic feasible functionals. Our proofs are based on essential applications of logic. We introduce a weak fragment of second order arithmetic with second order variables ranging over functions from N into N which suitably characterizes basic feasible functionals, and show that it is a useful tool for investigating the properties of basic feasible functionals. In particular, we provide an example how one can extract feasible "programs" from mathematical proofs which use non-feasible functionals (like second order polynomials).

Affiliated with

Also associated with

No associations

Rating

Some applications of logic to feasibility in higher types does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Some applications of logic to feasibility in higher types, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Some applications of logic to feasibility in higher types will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-402952