| Publication | Date of Publication | Type |
|---|
| Machine-checked meta-theory of dual-tableaux for intuitionistic logic | 2024-09-06 | Paper |
| A formally verified cut-elimination procedure for linear nested sequents for tense logic | 2022-05-25 | Paper |
| Machine-checked proof-theory for propositional modal logics | 2020-08-07 | Paper |
| Well-founded unions | 2018-10-18 | Paper |
| Issues in machine-checking the decidability of implicational ticket entailment | 2018-02-02 | Paper |
| Annotation-free sequent calculi for full intuitionistic linear logic | 2017-02-02 | Paper |
| Machine-checked interpolation theorems for substructural logics using display calculi | 2016-09-05 | Paper |
| From Display Calculi to Deep Nested Sequent Calculi: Formalised for Full Intuitionistic Linear Logic | 2014-09-15 | Paper |
| Formalising general correctness | 2013-08-30 | Paper |
| A new machine-checked proof of strong normalisation for display logic | 2013-08-27 | Paper |
| Generic methods for formalising sequent calculi applied to provability logic | 2010-10-12 | Paper |
| A proof theoretic analysis of intruder theories | 2010-09-21 | Paper |
| Formalising Observer Theory for Environment-Sensitive Bisimulation | 2009-10-20 | Paper |
| TERMINATION OF ABSTRACT REDUCTION SYSTEMS | 2009-04-14 | Paper |
| Formalising Generalised Substitutions | 2008-09-02 | Paper |
| Computer Science Logic | 2005-08-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4415138 | 2003-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4484337 | 2003-06-12 | Paper |
| Embedding display calculi into logical frameworks: Comparing Twelf and Isabelle | 2001-05-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4246973 | 2000-01-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4247208 | 2000-01-12 | Paper |
| An asymptotic result on the existence of generalised Hadamard matrices | 1994-07-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4033700 | 1993-05-16 | Paper |
| SOME NECESSARY CONDITIONS FOR SUMS OF MATROIDS | 1988-01-01 | Paper |
| Decomposition of binary matroids | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3701454 | 1985-01-01 | Paper |
| A construction for generalized Hadamard matrices GH(4q,EA(q)) | 1985-01-01 | Paper |
| Independence spaces and uniform modules | 1985-01-01 | Paper |
| Independence structures on the submodules of a module | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3676994 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3333052 | 1984-01-01 | Paper |
| The directed packing numbers DD(t,v,v), t\(\geq 4\) | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3331229 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3218263 | 1984-01-01 | Paper |
| Balanced sets in an independence structure induced by a submodular function | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3312252 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4742804 | 1982-01-01 | Paper |
| A MATROID THEORETIC APPROACH TO THE MATCHING STRUCTURE OF A GRAPH | 1982-01-01 | Paper |
| A Formula Approximating the Root of a Function | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3669429 | 1981-01-01 | Paper |
| A simple approach to some basic results in matroid theory | 1981-01-01 | Paper |
| The algebraic equivalence of two measures of genetic distance | 1981-01-01 | Paper |
| OPTIMAL MATROID BASES: AN ALGORITHM BASED ON COCIRCUITS | 1980-01-01 | Paper |
| A note on some algorithms for matroids | 1980-01-01 | Paper |
| Designs and circuit bases | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4182527 | 1978-01-01 | Paper |
| A remark on an exchange theorem for bases | 1978-01-01 | Paper |
| Balanced sets and circuits in a transversal space | 1977-01-01 | Paper |
