Looping Caterpillars. - Evan Goris; Maarten Marx (LICS, 2005)

PDL for Ordered Trees. - Loredana Afanasiev; Patrick Blackburn; Ioanna Dimitriou; Bertrand Gaiffe; Evan Goris; Maarten Marx; Maarten de Rijke (J. Appl. Non Class. Logics, 2005)

Logic of Proofs for Bounded Arithmetic. - Evan Goris (CSR, 2006)

Interpolation and the Interpretability Logic of PA. - Evan Goris (Notre Dame J. Formal Log., 2006)

Explicit Proofs in Formal Provability Logic. - Evan Goris (LFCS, 2007)

Modal Matters for Interpretability Logics. - Evan Goris; Joost J. Joosten (Log. J. IGPL, 2008)

Feasible Operations on Proofs: The Logic of Proofs for Bounded Arithmetic. - Evan Goris (Theory Comput. Syst., 2008)

A modal provability logic of explicit and implicit proofs. - Evan Goris (Ann. Pure Appl. Log., 2009)

A new principle in the interpretability logic of all reasonable arithmetical theories. - Evan Goris; Joost J. Joosten (Log. J. IGPL, 2011)

Self provers and Σ1 sentences. - Evan Goris; Joost J. Joosten (Log. J. IGPL, 2012)

Two New Series of Principles in the interpretability Logic of All Reasonable Arithmetical Theories. - Evan Goris; Joost J. Joosten (J. Symb. Log., 2020)

Theory and application of labelling techniques for interpretability logics. - Evan Goris; Marta Bílková; Joost J. Joosten; Luka Mikec (Math. Log. Q., 2022)