A Predicative Harmonization of the Time and Provable Hierarchies
Abstract
A decidable transfinite hierarchy is defined by assigning ordinals to the programs of an imperative language. It singles out: the classes TIMEF(nc) and TIMEF(nc); 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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.