Collapsing Graph Models by Preorders. - Raymond Hoofman; Harold Schellinx (Category Theory and Computer Science, 1991)

Isomorphisms and Nonisomorphisms of Graph Models. - Harold Schellinx (J. Symb. Log., 1991)

Some Syntactical Observations on Linear Logic. - Harold Schellinx (J. Log. Comput., 1991)

The Structure of Exponentials: Uncovering the Dynamics of Linear Logic Proofs. - Vincent Danos; Jean-Baptiste Joinet; Harold Schellinx (Kurt Gödel Colloquium, 1993)

Extending Intuitionistic Linear Logic with Knotted Structural Rules. - Ryuichi Hori; Hiroakira Ono; Harold Schellinx (Notre Dame J. Formal Log., 1994)

On the linear decoration of intuitionistic derivations. - Vincent Danos; Jean-Baptiste Joinet; Harold Schellinx (Arch. Math. Log., 1995)

Strong Normalization for All-Style LK. - Jean-Baptiste Joinet; Harold Schellinx; Lorenzo Tortora de Falco (TABLEAUX, 1996)

On the Jordan-Hölder decomposition of proof nets. - Quintijn Puite; Harold Schellinx (Arch. Math. Log., 1997)

A New Deconstructive Logic: Linear Logic. - Vincent Danos; Jean-Baptiste Joinet; Harold Schellinx (J. Symb. Log., 1997)

Basic Proof Theory, A.S. Troelstra and H. Schwichtenberg. - Harold Schellinx (J. Log. Lang. Inf., 1998)

Preface. - Jaap van Oosten; Harold Schellinx (Ann. Pure Appl. Log., 2002)

SN and CR for Free-Style LKtq: Linear Decorations and Simulation of Normalization. - Jean-Baptiste Joinet; Harold Schellinx; Lorenzo Tortora de Falco (J. Symb. Log., 2002)

Computational isomorphisms in classical logic. - Vincent Danos; Jean-Baptiste Joinet; Harold Schellinx (Theor. Comput. Sci., 2003)