| Publication | Date of Publication | Type |
|---|
| Analytic proof theory for Åqvist's system F | 2024-08-05 | Paper |
| Disambiguating permissions: a contribution from Mīmāṃsā | 2024-08-05 | Paper |
| Deontic equilibrium logic with explicit negation | 2024-05-29 | Paper |
| Internal and External Calculi: Ordering the Jungle without Being Lost in Translations | 2023-12-06 | Paper |
| Deontic paradoxes in Mīmāṃsā logics: there and back again | 2023-08-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5884946 | 2023-03-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5878366 | 2023-02-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5878362 | 2023-02-21 | Paper |
| Effective applicative structures | 2022-12-16 | Paper |
| Display to Labeled Proofs and Back Again for Tense Logics | 2022-02-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3384877 | 2021-12-17 | Paper |
| Bilattice CADIAG-II: Theory and Experimental Results | 2021-12-08 | Paper |
| A normative supervisor for reinforcement learning agents | 2021-12-01 | Paper |
| BOUNDED-ANALYTIC SEQUENT CALCULI AND EMBEDDINGS FOR HYPERSEQUENT LOGICS | 2021-10-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5144622 | 2021-01-19 | Paper |
| Bounded sequent calculi for non-classical logics via hypersequents | 2020-05-14 | Paper |
| On the concurrent computational content of intermediate logics | 2020-04-21 | Paper |
| Evaluating networks of arguments: a case study in Mīmāṃsā dialectics | 2020-01-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5224905 | 2019-07-24 | Paper |
| Hypersequents and Systems of Rules | 2018-08-10 | Paper |
| From cut-free calculi to automated deduction: the case of bounded contraction | 2018-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4636035 | 2018-04-23 | Paper |
| From display to labelled proofs for tense logics | 2018-04-06 | Paper |
| Proof search and co-NP completeness for many-valued logics | 2018-02-19 | Paper |
| Disjunctive Axioms and Concurrent $\lambda$-Calculi: a Curry-Howard Approach | 2018-02-03 | Paper |
| Power and Limits of Structural Display Rules | 2017-07-12 | Paper |
| Algebraic proof theory: hypersequents and hypercompletions | 2016-12-23 | Paper |
| Proof theory of witnessed Gödel logic: a negative result | 2016-04-28 | Paper |
| Automated Support for the Investigation of Paraconsistent and Other Logics | 2015-12-11 | Paper |
| Mīmāṃsā Deontic Logic: Proof Theory and Applications | 2015-12-11 | Paper |
| Uniform proofs of standard completeness for extensions of first-order MTL | 2015-10-12 | Paper |
| Taming Paraconsistent (and Other) Logics | 2015-09-17 | Paper |
| Hypersequent and display calculi -- a unified perspective | 2015-02-27 | Paper |
| Tools for the Investigation of Substructural and Paraconsistent Logics | 2015-01-14 | Paper |
| Proof theory for locally finite many-valued logics: semi-projective logics | 2013-11-29 | Paper |
| Hypersequent and Labelled Calculi for Intermediate Logics | 2013-10-04 | Paper |
| Structural Extensions of Display Calculi: A General Recipe | 2013-09-17 | Paper |
| Formal approaches to rule-based systems in medicine: the case of CADIAG-2 | 2013-06-13 | Paper |
| Standard Completeness for Extensions of MTL: An Automated Approach | 2012-09-21 | Paper |
| Algebraic proof theory for substructural logics: cut-elimination and completions | 2012-04-13 | Paper |
| Theorem proving for prenex Gödel logic with \(\Delta\): checking validity and unsatisfiability | 2012-04-03 | Paper |
| MacNeille completions of FL-algebras | 2011-12-14 | Paper |
| First-order satisfiability in Gödel logics: an NP-complete fragment | 2011-12-07 | Paper |
| Basic Constructive Connectives, Determinism and Matrix-Based Semantics | 2011-07-01 | Paper |
| Herbrand’s Theorem for Prenex Gödel Logic and Its Consequences for Theorem Proving | 2011-05-06 | Paper |
| On the (fuzzy) logical content of CADIAG-2 | 2010-07-28 | Paper |
| Algebraic and proof-theoretic characterizations of truth stressers for MTL and its extensions | 2010-03-18 | Paper |
| Automated Reasoning with Analytic Tableaux and Related Methods | 2010-03-09 | Paper |
| Expanding the Realm of Systematic Proof Theory | 2009-11-12 | Paper |
| Canonical Calculi: Invertibility, Axiom Expansion and (Non)-determinism | 2009-08-18 | Paper |
| SAT in Monadic Gödel Logics: A Borderline between Decidability and Undecidability | 2009-07-02 | Paper |
| Cut Elimination for First Order Gödel Logic by Hyperclause Resolution | 2009-01-27 | Paper |
| Density elimination | 2008-09-16 | Paper |
| Modular Cut-Elimination: Finding Proofs or Counterexamples | 2008-05-27 | Paper |
| Monadic Fragments of Gödel Logics: Decidability and Undecidability Results | 2008-05-15 | Paper |
| Towards an algorithmic construction of cut-elimination procedures | 2008-04-10 | Paper |
| Density Elimination and Rational Completeness for First-Order Logics | 2008-01-04 | Paper |
| Towards a semantic characterization of cut-elimination | 2006-03-17 | Paper |
| Logic for Programming, Artificial Intelligence, and Reasoning | 2005-11-10 | Paper |
| Computer Science Logic | 2005-08-22 | Paper |
| A proof-theoretical investigation of global intuitionistic (fuzzy) logic | 2005-05-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4825702 | 2004-11-05 | Paper |
| Hypersequent Calculi for Godel Logics -- a Survey | 2004-09-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4450443 | 2004-02-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4412849 | 2003-07-17 | Paper |
| A natural deduction system for intuitionistic fuzzy logic | 2003-03-31 | Paper |
| Hypersequent calculi for some intermediate logics with bounded Kripke models | 2002-07-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2767023 | 2002-06-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2721194 | 2001-07-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4501677 | 2001-01-11 | Paper |
| Finiteness in infinite-valued Łukasiewicz logic | 2000-12-17 | Paper |
| Sequent calculi for finite-valued Lukasiewicz logics via Boolean decompositions | 2000-06-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4263010 | 2000-02-28 | Paper |
| A sufficient condition for completability of partial combinatory algebras | 1999-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4218100 | 1999-03-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4364509 | 1997-11-17 | Paper |
