| Publication | Date of Publication | Type |
|---|
| All melodies are lost -- recognizability for weak and strong \(\alpha \)-register machines | 2024-01-12 | Paper |
| Correction to: Formal and Natural Proof: A Phenomenological Approach | 2023-09-20 | Paper |
| Formal and Natural Proof: A Phenomenological Approach | 2023-09-20 | Paper |
| What is worthy of investigation? Philosophical attitudes and their impact on mathematical development by the example of discovering 10-adic numbers | 2023-07-12 | Paper |
| Realisability for infinitary intuitionistic set theory | 2023-04-27 | Paper |
| Clockability for ordinal Turing machines | 2022-12-16 | Paper |
| Lower bounds on \(\beta (\alpha)\) | 2022-12-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5094854 | 2022-08-04 | Paper |
| Countable ranks at the first and second projective levels | 2022-07-18 | Paper |
| Decision times of infinite computations | 2022-07-13 | Paper |
| The lost melody theorem for infinite time Blum-Shub-Smale machines | 2022-03-22 | Paper |
| Randomising realizability | 2022-03-22 | Paper |
| Effectivity and reducibility with ordinal Turing machines | 2022-02-28 | Paper |
| Space-bounded OTMs and REG ∞ | 2022-02-28 | Paper |
| Taming Koepke's zoo. II: Register machines | 2022-01-18 | Paper |
| Models of true arithmetic are integer parts of models of real exponentation | 2021-05-26 | Paper |
| How to grow it? Strategies of mathematical development presented by the example of enumerating certain set partitions | 2021-04-19 | Paper |
| Lower bounds on $\beta(\alpha)$ and other properties of $\alpha$-ITRMs | 2021-02-26 | Paper |
| Randomising Realisability | 2021-01-29 | Paper |
| Space and time complexity for infinite time Turing machines | 2020-12-15 | Paper |
| Decision times of infinite computations | 2020-11-10 | Paper |
| Realisability for Infinitary Intuitionistic Set Theory | 2020-09-25 | Paper |
| The Lost Melody Theorem for Infinite Time Blum-Shub-Smale Machines | 2020-09-22 | Paper |
| Number Theory and Axiomatic Geometry in the Diproche System | 2020-06-02 | Paper |
| Automatized Evaluation of Formalization Exercises in Mathematics | 2020-06-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5109524 | 2020-05-12 | Paper |
| Using Automated Theorem Provers for Mistake Diagnosis in the Didactics of Mathematics | 2020-02-12 | Paper |
| Resetting Infinite Time Blum-Shub-Smale-Machines | 2020-01-20 | Paper |
| A Note on Clockability for Ordinal Turing Machines | 2019-06-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5380014 | 2019-06-14 | Paper |
| Space and Time Complexity for Infinite Time Turing Machines | 2019-05-16 | Paper |
| Ordinal computability. An introduction to infinitary machines | 2019-04-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4555783 | 2018-11-23 | Paper |
| Some observations on infinitary complexity | 2018-09-06 | Paper |
| Taming Koepke's zoo | 2018-09-06 | Paper |
| RANDOMNESS VIA INFINITE COMPUTATION AND EFFECTIVE DESCRIPTIVE SET THEORY | 2018-08-10 | Paper |
| A transfer principle for second-order arithmetic, and applications | 2018-04-04 | Paper |
| Reachability for infinite time Turing machines with long tapes | 2018-02-15 | Paper |
| Recognizable sets and Woodin cardinals: computation beyond the constructible universe | 2018-02-06 | Paper |
| Canonical Truth | 2017-12-07 | Paper |
| Infinite time recognizability from generic oracles and the recognizable jump operator1 | 2017-11-22 | Paper |
| Admissibles in gaps | 2017-08-04 | Paper |
| Koepke machines and satisfiability for infinitary propositional languages | 2017-08-04 | Paper |
| The recognizability strength of infinite time Turing machines with ordinal parameters | 2017-08-04 | Paper |
| Infinite computations with random oracles | 2017-07-21 | Paper |
| Space-Bounded OTMs and REG$^{\infty}$ | 2017-07-17 | Paper |
| On the value group of a model of Peano arithmetic | 2017-07-13 | Paper |
| Wie kommt man darauf? | 2017-06-30 | Paper |
| Randomness via infinite computation and effective descriptive set theory | 2016-12-09 | Paper |
| Structures associated with real closed fields and the axiom of choice | 2016-10-25 | Paper |
| Generalized Effective Reducibility | 2016-08-17 | Paper |
| Randomness and degree theory for infinite time register machines1 | 2016-07-25 | Paper |
| A note on $\mathbb{Z}$ as a direct summand of nonstandard models of weak systems of arithmetic | 2016-05-30 | Paper |
| OPTIMAL RESULTS ON RECOGNIZABILITY FOR INFINITE TIME REGISTER MACHINES | 2016-03-22 | Paper |
| $$ITRM$$-Recognizability from Random Oracles | 2015-10-20 | Paper |
| The Lost Melody Phenomenon | 2015-04-09 | Paper |
| Algorithmic Randomness for Infinite Time Register Machines | 2015-02-25 | Paper |
| On a Diophantine representation of the predicate of provability | 2015-02-13 | Paper |
| A Note on Always Decidable Propositional Forms | 2015-02-09 | Paper |
| A Note on the Decidability of the Necessity of Axioms | 2014-08-22 | Paper |
| The distribution of ITRM-recognizable reals | 2014-06-06 | Paper |
| A note on Autoreducibility for Infinite Time Register Machines and parameter-free Ordinal Turing Machines | 2014-02-05 | Paper |
| Towards a Church-Turing-Thesis for Infinitary Computations | 2013-07-24 | Paper |
| A polynomial encoding provability in pure mathematics (outline of an explicit construction) | 2013-07-11 | Paper |
| Optimal Results on ITRM-recognizability | 2013-06-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2905691 | 2012-08-28 | Paper |
| A Computational Approach to an Alternative Working Environment for the Constructible Universe | 2011-09-09 | Paper |
| The basic theory of infinite time register machines | 2010-03-02 | Paper |
| A Note on OTM-Realizability and Constructive Set Theories | 0001-01-03 | Paper |
