| Publication | Date of Publication | Type |
|---|
| The logicality of equality | 2024-10-01 | Paper |
| A cut-free, sound and complete Russellian theory of definite descriptions | 2024-05-17 | Paper |
| Towards proof-theoretic formulation of the general theory of term-forming operators | 2024-05-17 | Paper |
| A Uniform Formalisation of Three-Valued Logics in Bisequent Calculus | 2024-04-26 | Paper |
| Bisequent calculus for four-valued quasi-relevant logics: cut elimination and interpolation | 2024-02-06 | Paper |
| A novel approach to equality | 2024-01-26 | Paper |
| RUSSELLIAN DEFINITE DESCRIPTION THEORY—A PROOF THEORETIC APPROACH | 2023-05-26 | Paper |
| Dialogues and Proofs; Yankov’s Contribution to Proof Theory | 2023-04-05 | Paper |
| Leśniewski's ontology -- proof-theoretic characterization | 2022-12-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5104714 | 2022-09-15 | Paper |
| Tableaux for free logics with descriptions | 2022-05-25 | Paper |
| Free logics are cut-free | 2021-11-11 | Paper |
| Free Definite Description Theory – Sequent Calculi and Cut Elimination | 2021-08-17 | Paper |
| Sequents and trees. An introduction to the theory and applications of propositional sequent calculi | 2020-10-14 | Paper |
| Two is enough -- bisequent calculus for S5 | 2020-05-13 | Paper |
| CUT ELIMINATION IN HYPERSEQUENT CALCULUS FOR SOME LOGICS OF LINEAR TIME | 2020-02-20 | Paper |
| Fregean Description Theory in Proof-Theoretical Setting | 2020-02-11 | Paper |
| Cut-free modal theory of definite descriptions | 2019-07-24 | Paper |
| Rule-Generation Theorem and its Applications | 2019-05-15 | Paper |
| Stanisław Jaśkowski and Natural Deduction Systems | 2019-01-21 | Paper |
| Stanisław Jaśkowski: life and work | 2019-01-21 | Paper |
| Tautology elimination, cut elimination, and S5 | 2018-06-13 | Paper |
| Cut elimination theorem for non-commutative hypersequent calculus | 2018-03-21 | Paper |
| Simple decision procedure for \(\mathbf {S5}\) in standard cut-free sequent calculus | 2017-11-17 | Paper |
| LINEAR TIME IN HYPERSEQUENT FRAMEWORK | 2017-05-26 | Paper |
| Hypersequent calculi for S5: the methods of cut elimination | 2017-05-18 | Paper |
| Simple cut elimination proof for hybrid logic | 2017-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2966675 | 2017-03-08 | Paper |
| A survey of nonstandard sequent calculus | 2015-11-13 | Paper |
| Decision procedures for some strong hybrid logics | 2015-04-09 | Paper |
| A survey of nonstandard sequent calculi | 2015-02-27 | Paper |
| Contraction contracted | 2015-02-09 | Paper |
| Eliminability of cut in hypersequent calculi for some modal logics of linear frames | 2014-12-09 | Paper |
| Cut-free hypersequent calculus for S4.3. | 2014-04-29 | Paper |
| Labelled tableau calculi for weak modal logics | 2014-04-23 | Paper |
| Correspondence theory in proof theory | 2014-04-23 | Paper |
| Suszko's contribution to the theory of nonaxiomatic proof systems | 2014-04-23 | Paper |
| Natural deduction, hybrid systems and modal logics | 2012-01-19 | Paper |
| Admissibility of cut in congruent modal logics | 2012-01-05 | Paper |
| Possible worlds in use | 2011-11-23 | Paper |
| Modal Hybrid Logic | 2008-03-06 | Paper |
| Sequent calculi for monotonic modal logics | 2007-04-25 | Paper |
| A labelled natural deduction system for linear temporal logic | 2004-01-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4438235 | 2003-12-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4443203 | 2002-01-01 | Paper |
| Jaśkowski and Gentzen approaches to natural deduction and related systems | 2001-08-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4943267 | 2000-07-31 | Paper |
| Cut-free double sequent calculus for S5 | 1999-04-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4229377 | 1999-02-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5283968 | 1997-02-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4870571 | 1996-07-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4323646 | 1995-07-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4294473 | 1995-02-16 | Paper |