| Publication | Date of Publication | Type |
|---|
| A Simplified Application of Howard’s Vector Notation System to Termination Proofs for Typed Lambda-Calculus Systems | 2022-12-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5018496 | 2021-12-20 | Paper |
| A small remark on Hilbert's finitist view of divisibility and Kanovich-Okada-Scedrov's logical analysis of real-time systems | 2021-07-08 | Paper |
| Following a Rule: Waismann’s Variation | 2020-08-21 | Paper |
| Corrigendum to: ``Inductive-data-type systems | 2020-04-01 | Paper |
| Verification Methods for the Computationally Complete Symbolic Attacker Based on Indistinguishability | 2019-11-22 | Paper |
| A Note on Switching Conditions for the Generalized Logical Connectives in Multiplicative Linear Logic | 2018-04-07 | Paper |
| Semantics for "enough-certainty" and fitting's embedding of classical logic in S4 | 2017-07-19 | Paper |
| Syntactic reduction in Husserl's early phenomenology of arithmetic | 2017-03-14 | Paper |
| Husserl and Hilbert on Completeness and Husserl's Term Rewrite-based Theory of Multiplicity (Invited Talk) | 2017-02-01 | Paper |
| A diagrammatic inference system with Euler circles | 2015-02-09 | Paper |
| Completeness and counter-example generations of a basic protocol logic (extended abstract) | 2013-12-04 | Paper |
| A generalized syllogistic inference system based on inclusion and exclusion relations | 2012-12-04 | Paper |
| Computational Semantics for First-Order Logical Analysis of Cryptographic Protocols | 2009-06-09 | Paper |
| Remarks on Semantic Completeness for Proof-Terms with Laird’s Dual Affine/Intuitionistic λ-Calculus | 2009-03-06 | Paper |
| Some Remarks on a Difference between Gentzen's Finitist and Heyting's Intuitionist Approaches toward Intuitionistic Logic and Arithmetic | 2008-12-01 | Paper |
| Drug Interaction Ontology (DIO) and the Resource-Sensitive Logical Inferences | 2007-09-07 | Paper |
| Intuitionistic phase semantics is almost classical | 2006-05-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3044485 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4418591 | 2003-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4418592 | 2003-08-11 | Paper |
| Phase semantics for light linear logic | 2003-07-29 | Paper |
| A graph-theoretic characterization theorem for multiplicative fragment of non-commutative linear logic | 2003-07-29 | Paper |
| A new correctness criterion for the proof nets of non-commutative multiplicative linear logics | 2002-10-08 | Paper |
| A uniform semantic proof for cut-elimination and completeness of various first and higher order logics. | 2002-07-15 | Paper |
| Inductive-data-type systems | 2002-03-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4938611 | 2000-09-13 | Paper |
| Phase semantic cut-elimination and normalization proofs of first- and higher-order linear logic | 2000-08-23 | Paper |
| The finite model property for various fragments of intuitionistic linear logic | 2000-02-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4703047 | 1999-12-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4699356 | 1999-11-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252642 | 1999-11-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252643 | 1999-11-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252650 | 1999-11-08 | Paper |
| A direct independence proof of Buchholz's Hydra Game on finite labeled trees | 1999-03-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4222893 | 1998-12-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4222841 | 1998-12-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4222840 | 1998-12-14 | Paper |
| Abstract data type systems | 1998-07-22 | Paper |
| A Relationship Among Gentzen's Proof-Reduction, Kirby-Paris' Hydra Game and Buchholz's Hydra Game | 1997-04-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4282539 | 1994-10-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4036585 | 1993-05-18 | Paper |
| A rationale for conditional equational programming | 1990-01-01 | Paper |
| Weak Logical Constants and Second Order Definability of the Full-Strength Logical Constants | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3817653 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3819993 | 1988-01-01 | Paper |
| On a theory of weak implications | 1988-01-01 | Paper |
| Note on a proof of the extended Kirby-Paris theorem on labelled finite trees | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3820053 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3786478 | 1987-01-01 | Paper |
| A weak intuitionistic propositional logic with purely constructive implication | 1987-01-01 | Paper |
| A simple relationship between Buchholz's new system of ordinal notations and Takeuti's system of ordinal diagrams | 1987-01-01 | Paper |
