| Analyticity, Balance and Non-admissibility of \(\varvec{Cut}\) in Stoic Logic | 0 | 0.34 | 2019 |
| Contraction-Free Sequent Calculi for intuitionistic Logic: a correction. | 0 | 0.34 | 2018 |
| POSIX Lexing with Derivatives of Regular Expressions. | 1 | 0.39 | 2016 |
| A cut-free sequent system for Grzegorczyk logic, with an application to the Gödel-McKinsey-Tarski embedding. | 6 | 0.55 | 2016 |
| Posix Lexing With Derivatives Of Regular Expressions (Proof Pearl) | 0 | 0.34 | 2016 |
| Invited Talk: Coherentisation of First-Order Logic. | 0 | 0.34 | 2015 |
| Geometrisation of first-order logic | 9 | 0.53 | 2015 |
| Algebra, proof theory and applications for an intuitionistic logic of propositions, actions and adjoint modal operators | 3 | 0.43 | 2013 |
| Proof analysis in intermediate logics | 27 | 1.22 | 2012 |
| A Note on Harmony. | 17 | 1.20 | 2012 |
| Algebra, Proof Theory and Applications for a Logic of Propositions, Actions and Adjoint Modal Operators | 1 | 0.36 | 2012 |
| A Focused Sequent Calculus Framework for Proof Search in Pure Type Systems | 11 | 0.66 | 2011 |
| Proof-Theoretic Semantics for Subsentential Phrases | 17 | 1.43 | 2010 |
| Positive Logic with Adjoint Modalities: Proof Theory, Semantics and Reasoning about Information | 11 | 0.92 | 2009 |
| Proof-theoretic semantics for a natural language fragment | 19 | 1.78 | 2009 |
| Call-by-Value lambda-calculus and LJQ | 4 | 0.41 | 2007 |
| LJQ: a strongly focused calculus for intuitionistic logic | 22 | 1.28 | 2006 |
| A sequent calculus for type theory | 5 | 0.44 | 2006 |
| Towards Formally Verifiable WCET Analysis for a Functional Programming Language | 4 | 0.41 | 2006 |
| Strong cut-elimination systems for hudelmaier's depth-bounded sequent calculus for implicational logic | 0 | 0.34 | 2006 |
| Decision methods for linearly ordered Heyting algebras | 6 | 0.57 | 2006 |
| The Embounded project (project start paper) | 3 | 0.52 | 2005 |
| Strong Normalization of Herbelin's Explicit Substitution Calculus with Substitution Propagation | 14 | 0.77 | 2003 |
| Admissibility of Structural Rules for Extensions of Contraction-Free Sequent Calculi | 3 | 0.47 | 2001 |
| Admissibility of Structural Rules for Contraction-Free Systems of Intuitionistic Logic | 11 | 1.81 | 2000 |
| Automated Reasoning with Analytic Tableaux and Related Methods, International Conference, TABLEAUX 2000, St Andrews, Scotland, UK, July 3-7, 2000, Proceedings | 33 | 5.27 | 2000 |
| Permutability of proofs in intuitionistic sequent calculi | 17 | 3.79 | 1999 |
| A Deterministic Terminating Sequent Calculus for Gödel-Dummett logic | 29 | 2.42 | 1999 |
| Cut-Elimination and a Permutation-Free Sequent Calculus for Intuitionistic Logic | 15 | 1.20 | 1998 |
| Sequent Calculi for the Normal Terms of the - and - Calculi | 2 | 0.37 | 1998 |
| Extensions of Logic Programming, 5th International Workshop, ELP'96, Leipzig, Germany, March 28-30, 1996, Proceedings | 21 | 2.90 | 1996 |
| Uniform proofs and natural deductions | 2 | 0.49 | 1994 |
| Proof Search (Tutorial). | 0 | 0.34 | 1994 |
| Extensions of Logic Programming, 4th International Workshop, ELP'93, St. Andrews, U.K., March 29 - April 1, 1993, Proceedings | 21 | 1.74 | 1994 |
| Introduction to ELP'93 | 0 | 0.34 | 1993 |
| Contraction-Free Sequent Calculi For Intuitionistic Logic | 118 | 12.39 | 1992 |
