2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/116172A 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 Σ_k-IND fragments of PA. Limited operators, diagonalization, and majorization functions are not used.11 pagesLogic in Computer ScienceComputational Complexitytext