Some Results in Computational Topology. - George Tourlakis; John Mylopoulos (J. ACM, 1973)

An Inductive Number-Theoretic Characterization of NP. - George Tourlakis (Inf. Process. Lett., 1984)

Some Reflections on the Foundations of Ordinary Recursion Theory and a New Proposal. - George Tourlakis (Math. Log. Q., 1986)

Recursion in Partial Type-1 Objects With Well-Behaved Oracles. - George Tourlakis (Math. Log. Q., 1996)

Computability in Type-2 Objects with Well-Behaved Type-1 Oracles is p-Normal. - George Tourlakis (Fundam. Informaticae, 2001)

On the Soundness and Completeness of Equational Predicate Logics. - George Tourlakis (J. Log. Comput., 2001)

A Modal Extension of Weak Generalisation Predicate Logic. - Francisco Kibedi; George Tourlakis (Log. J. IGPL, 2006)

On the Proof-Theory of two Formalisations of Modal First-Order Logic. - Yehuda Schwartz; George Tourlakis (Stud Logica, 2010)

Computability - George Tourlakis (Springer, 2022)