Consistency proof without transfinite induction for a formal system for turing machines. - Salvatore Caporaso (Arch. Math. Log., 1978)

Undecidability vs transfinite induction for the consistency of hyperarithmetical sets. - Salvatore Caporaso; Giovanni Pani (Arch. Math. Log., 1980)

Safe Turing Machines, Grzegorczyk Classes and Polytime. - Salvatore Caporaso (Int. J. Found. Comput. Sci., 1996)

Syntactic Characterization in LISP of the Polynominal Complexity Classes and Hierarchy. - Salvatore Caporaso; Michele Zito 001; Nicola Galesi; Emanuele Covino (CIAC, 1997)

On a Relation Between Uniform Coding and Problems of the Form DTIMEF(F) =? DSPACEF(F). - Salvatore Caporaso; Michele Zito 001 (Acta Informatica, 1998)

Extending the Implicit Computational Complexity Approach to the Sub-elementary Time-Space Classes. - Emanuele Covino; Giovanni Pani; Salvatore Caporaso (CIAC, 2000)

Incompleteness in Linear Time. - Salvatore Caporaso; Giovanni Pani; Emanuele Covino (J. Univers. Comput. Sci., 2000)

A predicative approach to the classification problem. - Salvatore Caporaso; Emanuele Covino; Giovanni Pani (J. Funct. Program., 2001)

A predicative and decidable characterization of the polynomial classes of languages. - Salvatore Caporaso; Michele Zito 001; Nicola Galesi (Theor. Comput. Sci., 2001)

A Predicative Harmonization of the Time and Provable Hierarchies - Salvatore Caporaso (CoRR, 2006)

A decidable characterization of the classes between lintime and exptime. - Salvatore Caporaso (Inf. Process. Lett., 2006)

Kleene, Rogers and Rice Theorems Revisited in C and in Bash - Salvatore Caporaso; Nicola Corriero (CoRR, 2007)