Contraction-Free Sequent Calculi for Intuitionistic Logic. - Roy Dyckhoff (J. Symb. Log., 1992)

Introduction to ELP'93. - Roy Dyckhoff (ELP, 1993)

Uniform Proofs and Natural Deduction. - Roy Dyckhoff; Luís Pinto 001 (ICLP Workshop: Proof-Theoretical Extensions on Logic Programming, 1994)

Proof Search (Tutorial). - Roy Dyckhoff; Natarajan Shankar (ICLP Workshop: Proof-Theoretical Extensions on Logic Programming, 1994)

Sequent Calculi for the Normal Terms of the - and - Calculi. - Luís Pinto 001; Roy Dyckhoff (Proof Search in Type-Theoretic Languages@CADE, 1998)

Cut-Elimination and a Permutation-Free Sequent Calculus for Intuitionistic Logic. - Roy Dyckhoff; Luís Pinto 001 (Stud Logica, 1998)

A Deterministic Terminating Sequent Calculus for Gödel-Dummett logic. - Roy Dyckhoff (Log. J. IGPL, 1999)

Permutability of Proofs in Intuitionistic Sequent Calculi. - Roy Dyckhoff; Luís Pinto 001 (Theor. Comput. Sci., 1999)

Admissibility of Structural Rules for Contraction-Free Systems of Intuitionistic Logic. - Roy Dyckhoff; Sara Negri (J. Symb. Log., 2000)

Admissibility of Structural Rules for Extensions of Contraction-Free Sequent Calculi. - Roy Dyckhoff; Sara Negri (Log. J. IGPL, 2001)

Editorial. - Roy Dyckhoff; Heinrich Wansing (Stud Logica, 2001)

Strong Normalization of Herbelin's Explicit Substitution Calculus with Substitution Propagation. - Roy Dyckhoff; Christian Urban (J. Log. Comput., 2003)

The Embounded project (project start paper). - Kevin Hammond; Roy Dyckhoff; Christian Ferdinand; Reinhold Heckmann; Martin Hofmann 001; Steffen Jost; Hans-Wolfgang Loidl; Greg Michaelson; Robert F. Pointon; Norman Scaife; Jocelyn Sérot; Andy Wallace (Trends in Functional Programming, 2005)

Strong Cut-Elimination Systems for Hudelmaier's Depth-Bounded Sequent Calculus for Implicational Logic. - Roy Dyckhoff; Delia Kesner; Stéphane Lengrand (IJCAR, 2006)

LJQ: A Strongly Focused Calculus for Intuitionistic Logic. - Roy Dyckhoff; Stéphane Lengrand (CiE, 2006)

A Sequent Calculus for Type Theory. - Stéphane Lengrand; Roy Dyckhoff; James McKinna (CSL, 2006)

Towards Formally Verifiable WCET Analysis for a Functional Programming Language. - Kevin Hammond; Christian Ferdinand; Reinhold Heckmann; Roy Dyckhoff; Martin Hofmann 001; Steffen Jost; Hans-Wolfgang Loidl; Greg Michaelson; Robert F. Pointon; Norman Scaife; Jocelyn Sérot; Andy Wallace (WCET, 2006)

Decision methods for linearly ordered Heyting algebras. - Roy Dyckhoff; Sara Negri (Arch. Math. Log., 2006)

Call-by-Value lambda-calculus and LJQ. - Roy Dyckhoff; Stéphane Lengrand (J. Log. Comput., 2007)

Proof-Theoretic Semantics for a Natural Language Fragment. - Nissim Francez; Roy Dyckhoff (MOL, 2009)

Positive Logic with adjoint Modalities: Proof Theory, Semantics, and Reasoning about Information. - Mehrnoosh Sadrzadeh; Roy Dyckhoff (Rev. Symb. Log., 2010)

Proof-Theoretic Semantics for Subsentential Phrases. - Nissim Francez; Roy Dyckhoff; Gilad Ben-Avi (Stud Logica, 2010)

A Focused Sequent Calculus Framework for Proof Search in Pure Type Systems - Stéphane Lengrand; Roy Dyckhoff; James McKinna (Log. Methods Comput. Sci., 2011)

Proof analysis in intermediate logics. - Roy Dyckhoff; Sara Negri (Arch. Math. Log., 2012)

Algebra, Proof Theory and Applications for a Logic of Propositions, Actions and Adjoint Modal Operators. - Roy Dyckhoff; Mehrnoosh Sadrzadeh; Julien Truffaut (MFPS, 2012)

A Note on Harmony. - Nissim Francez; Roy Dyckhoff (J. Philos. Log., 2012)

Algebra, proof theory and applications for an intuitionistic logic of propositions, actions and adjoint modal operators. - Roy Dyckhoff; Mehrnoosh Sadrzadeh; Julien Truffaut (ACM Trans. Comput. Log., 2013)

Invited Talk: Coherentisation of First-Order Logic. - Roy Dyckhoff (TABLEAUX, 2015)

Geometrisation of First-order Logic. - Roy Dyckhoff; Sara Negri (Bull. Symb. Log., 2015)

Some Remarks on Proof-Theoretic Semantics. - Roy Dyckhoff (Advances in Proof-Theoretic Semantics, 2016)

POSIX Lexing with Derivatives of Regular Expressions (Proof Pearl). - Fahad Ausaf; Roy Dyckhoff; Christian Urban (ITP, 2016)

POSIX Lexing with Derivatives of Regular Expressions. - Fahad Ausaf; Roy Dyckhoff; Christian Urban (Arch. Formal Proofs, 2016)

A cut-free sequent system for Grzegorczyk logic, with an application to the Gödel-McKinsey-Tarski embedding. - Roy Dyckhoff; Sara Negri (J. Log. Comput., 2016)

Commentary on Grigori Mints' "Classical and Intuitionistic Geometric Logic". - Roy Dyckhoff; Sara Negri (FLAP, 2017)

Contraction-Free Sequent Calculi for intuitionistic Logic: a correction. - Roy Dyckhoff (J. Symb. Log., 2018)

Indirect Proof and Inversions of Syllogisms. - Roy Dyckhoff (Bull. Symb. Log., 2019)

Analyticity, Balance and Non-admissibility of $$ varvec{Cut}$$ Cut in Stoic Logic. - Susanne Bobzien; Roy Dyckhoff (Stud Logica, 2019)