A Predicative Harmonization of the Time and Provable Hierarchies

Simple item page
dc.creatorCaporaso, Salvatore
dc.date2006-09-23
dc.date.accessioned2026-07-07T07:23:57Z
dc.date.available2026-07-07T07:23:57Z
dc.descriptionA 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.
dc.description11 pages
dc.identifierhttps://arxiv.org/abs/cs/0609130
dc.identifierhttp://arxiv.org/abs/cs/0609130
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/116172
dc.subjectLogic in Computer Science
dc.subjectComputational Complexity
dc.titleA Predicative Harmonization of the Time and Provable Hierarchies
dc.typetext

Files

Collections

arXiv