Predicatively computable functions on sets

Details Predicatively computable functions on sets Predicatively computable functions on sets

2012-04-25

arxiv.org/abs/1204.5582v1

Mathematics

Logic

Scientific paper

Inspired from a joint work by A. Beckmann, S. Buss and S. Friedman, we
propose a class of set-theoretic functions, predicatively computable functions.
Each function in this class is polynomial time computable when we restrict to
finite binary strings. Moreover a fragment of set theory is given in which
\Sigma_1-definable functions are exactly the functions in the class.

Affiliated with

Also associated with

No associations

Rating

Predicatively computable functions on sets 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 Predicatively computable functions on sets, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Predicatively computable functions on sets will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-137565