Incompleteness theorem via weak definability of truth: a short proof. - Giorgio Germano (Notre Dame J. Formal Log., 1973)

Loops in Algol 60 and in category theory. - Giorgio Germano; Andrea Maggiolo-Schettini (SIGACT News, 1974)

Sequence-to-Sequence Recursiveness. - Giorgio Germano; Andrea Maggiolo-Schettini (Inf. Process. Lett., 1975)

Proving a Compiler Correct: A Simple Approach. - Giorgio Germano; Andrea Maggiolo-Schettini (J. Comput. Syst. Sci., 1975)

Recursivity, Sequence Recursivity, Stack Recursivity and Semantics of Programs. - Giorgio Germano; Andrea Maggiolo-Schettini (MFCS, 1976)

A language for Markov's algorithms composition. - Giorgio Germano; Andrea Maggiolo-Schettini (Acta Cybern., 1976)

An arithmetical reconstruction of the liar's antinomy using addition and multiplication. - Giorgio Germano (Notre Dame J. Formal Log., 1976)

Computable Stack Functions for Semantics of Stack Programs. - Giorgio Germano; Andrea Maggiolo-Schettini (J. Comput. Syst. Sci., 1979)

Sequence Recursiveness Without Cylindrification and Limited Register Machines. - Giorgio Germano; Andrea Maggiolo-Schettini (Theor. Comput. Sci., 1981)

A Setting for Generalized Computability. - Giorgio Germano; Stefano Mazzanti (Computation Theory and Logic, 1987)

Loose Diagrams, Semigroupoids, Categories, Groupoids and Iteration. - Giorgio Germano; Stefano Mazzanti (CSL, 1987)

General Iteration and Unary Functions. - Giorgio Germano; Stefano Mazzanti (Ann. Pure Appl. Log., 1991)

Closure Functions and General Iterates as Reflectors. - Giorgio Germano; Stefano Mazzanti (Theor. Comput. Sci., 1991)

Peano Structures and the Semantics of Iteration. - Giorgio Germano; Stefano Mazzanti (COMETA, 2003)