Termination Proofs in the Dependency Pair Framework May Induce Multiple Recursive Derivational Complexity

Details Termination Proofs in the Dependency Pair Framework May Induce Multiple Recursive Derivational Complexity Termination Proofs in the Dependency Pair Framework May Induce Multiple Recursive Derivational Complexity

2011-03-25

arxiv.org/abs/1103.5082v1

Computer Science

Logic in Computer Science

22 pages, extended conference version

Scientific paper

We study the derivational complexity of rewrite systems whose termination is provable in the dependency pair framework using the processors for reduction pairs, dependency graphs, or the subterm criterion. We show that the derivational complexity of such systems is bounded by a multiple recursive function, provided the derivational complexity induced by the employed base techniques is at most multiple recursive. Moreover we show that this upper bound is tight.

Affiliated with

Also associated with

No associations

Rating

Termination Proofs in the Dependency Pair Framework May Induce Multiple Recursive Derivational Complexity 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 Termination Proofs in the Dependency Pair Framework May Induce Multiple Recursive Derivational Complexity, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Termination Proofs in the Dependency Pair Framework May Induce Multiple Recursive Derivational Complexity will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-223332