A Predicative Harmonization of the Time and Provable Hierarchies
Logic in Computer Science
2007-05-23 v1 Computational Complexity
Abstract
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.
Cite
@article{arxiv.cs/0609130,
title = {A Predicative Harmonization of the Time and Provable Hierarchies},
author = {Salvatore Caporaso},
journal= {arXiv preprint arXiv:cs/0609130},
year = {2007}
}
Comments
11 pages