A Predicative Harmonization of the Time and Provable Hierarchies

Details A Predicative Harmonization of the Time and Provable Hierarchies A Predicative Harmonization of the Time and Provable Hierarchies

2006-09-23

arxiv.org/abs/cs/0609130v1

Computer Science

Logic in Computer Science

11 pages

Scientific paper

A decidable transfinite hierarchy is defined by assigning ordinals to the
programs of an imperative language. It singles out: the classes TIMEF(n^c) and
TIMEF(n_c); the finite Grzegorczyk classes at and above the elementary level,
and the \Sigma_k-IND fragments of PA. Limited operators, diagonalization, and
majorization functions are not used.

Affiliated with

Also associated with

No associations

Rating

A Predicative Harmonization of the Time and Provable Hierarchies 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 A Predicative Harmonization of the Time and Provable Hierarchies, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Predicative Harmonization of the Time and Provable Hierarchies will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-659517