| Publication | Date of Publication | Type |
|---|
| Correction to: ``Arithmetical and hyperarithmetical worm battles | 2024-11-12 | Paper |
| An overview of Verbrugge semantics, a.k.a. generalised Veltman semantics | 2024-10-01 | Paper |
| AN ESCAPE FROM VARDANYAN’S THEOREM | 2023-12-22 | Paper |
| Strictly Positive Fragments of the Provability Logic of Heyting Arithmetic | 2023-12-22 | Paper |
| Theory and application of labelling techniques for interpretability logics | 2023-09-12 | Paper |
| Arithmetical and Hyperarithmetical Worm Battles | 2023-01-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5104696 | 2022-09-15 | Paper |
| Hyperarithmetical worm battles | 2022-07-01 | Paper |
| MÜNCHHAUSEN PROVABILITY | 2021-12-09 | Paper |
| To drive or not to drive: a logical and computational analysis of European transport regulations | 2021-09-21 | Paper |
| An overview of Generalised Veltman Semantics | 2020-07-09 | Paper |
| The logic of Turing progressions | 2020-05-04 | Paper |
| The interpretability logic of all reasonable arithmetical theories | 2020-04-27 | Paper |
| TWO NEW SERIES OF PRINCIPLES IN THE INTERPRETABILITY LOGIC OF ALL REASONABLE ARITHMETICAL THEORIES | 2020-04-17 | Paper |
| Quantified Reflection Calculus with one modality | 2020-03-30 | Paper |
| Assuring and critical labels for relations between maximal consistent sets for interpretability logics | 2020-03-10 | Paper |
| Characterizations of interpretability in bounded arithmetic | 2020-02-03 | Paper |
| M\"unchhausen provability | 2019-08-29 | Paper |
| Relational Semantics for the Turing Schmerl Calculus | 2019-07-24 | Paper |
| The Worm Calculus | 2019-07-24 | Paper |
| Labelled tableaux for interpretability logics | 2019-07-24 | Paper |
| The Reduction Property Revisited | 2019-03-08 | Paper |
| Well-orders in the transfinite Japaridze algebra | 2019-01-08 | Paper |
| The omega-rule interpretation of transfinite provability logic | 2018-02-06 | Paper |
| PREDICATIVITY THROUGH TRANSFINITE REFLECTION | 2017-09-26 | Paper |
| Turing-Taylor expansions for arithmetic theories | 2017-03-02 | Paper |
| Fractal dimension versus process complexity | 2017-01-17 | Paper |
| The closed fragment of IL is PSPACE hard | 2016-10-07 | Paper |
| Turing Jumps Through Provability | 2015-10-20 | Paper |
| Two series of formalized interpretability principles for weak systems of arithmetic | 2015-03-31 | Paper |
| On provability logics with linearly ordered modalities | 2014-09-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5419879 | 2014-06-11 | Paper |
| A secure additive protocol for card players | 2014-01-03 | Paper |
| Hyperations, Veblen progressions and transfinite iteration of ordinal functions | 2013-11-29 | Paper |
| \(\Pi_1^0\)-ordinal analysis beyond first-order arithmetic | 2013-11-14 | Paper |
| Models of transfinite provability logic | 2013-06-24 | Paper |
| Turing Progressions and Their Well-Orders | 2012-08-14 | Paper |
| Self provers and \(\Sigma_{1}\) sentences | 2012-08-01 | Paper |
| Provability and interpretability logics with restricted realizations | 2012-07-11 | Paper |
| Well-orders in the transfinite Japaridze algebra II: Turing progressions and their well-orders | 2012-04-20 | Paper |
| Hidden Variables Simulating Quantum Contextuality Increasingly Violate the Holevo Bound | 2011-06-17 | Paper |
| A new principle in the interpretability logic of all reasonable arithmetical theories | 2011-03-07 | Paper |
| Consistency statements and iterations of computable functions in \(\mathrm{I}\Sigma_1\) and PRA | 2010-10-27 | Paper |
| Interpretability in PRA | 2009-11-04 | Paper |
| Modal Matters for Interpretability Logics | 2008-11-13 | Paper |
| Propositional proof systems and fast consistency provers | 2008-02-05 | Paper |
| A Finitary Treatment of the Closed Fragment of Japaridze's Provability Logic | 2005-10-18 | Paper |
| The closed fragment of the interpretability logic of PRA with a constant for I\(\Sigma^1\) | 2005-09-28 | Paper |
| The interpretability logic of all reasonable arithmetical theories. The new conjecture | 2001-12-18 | Paper |