| Publication | Date of Publication | Type |
|---|
Understanding mathematical texts: a hermeneutical approach
Synthese | 2026-03-27 | Paper |
| Full generalized effective reducibility | 2025-11-19 | Paper |
Lower bounds on () and other properties of -register machines
Computability | 2025-03-03 | Paper |
| Almost sure OTM-realizability | 2025-02-07 | Paper |
The negative theology of absolute infinity: Cantor, mathematics, and humility
International Journal for Philosophy of Religion | 2024-07-10 | Paper |
All melodies are lost -- recognizability for weak and strong \(\alpha \)-register machines
Lecture Notes in Computer Science | 2024-01-12 | Paper |
Formal and Natural Proof: A Phenomenological Approach
Synthese Library | 2023-09-20 | Paper |
Correction to: Formal and Natural Proof: A Phenomenological Approach
Synthese Library | 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
Mathematische Semesterberichte | 2023-07-12 | Paper |
Realisability for infinitary intuitionistic set theory
Annals of Pure and Applied Logic | 2023-04-27 | Paper |
Clockability for ordinal Turing machines
(available as arXiv preprint) | 2022-12-16 | Paper |
| Lower bounds on \(\beta (\alpha)\) | 2022-12-07 | Paper |
| scientific article; zbMATH DE number 7568205 (Why is no real title available?) | 2022-08-04 | Paper |
| Countable ranks at the first and second projective levels | 2022-07-18 | Paper |
Decision times of infinite computations
Notre Dame Journal of Formal Logic | 2022-07-13 | Paper |
The lost melody theorem for infinite time Blum-Shub-Smale machines
(available as arXiv preprint) | 2022-03-22 | Paper |
Randomising realizability
(available as arXiv preprint) | 2022-03-22 | Paper |
Effectivity and reducibility with ordinal Turing machines
Computability | 2022-02-28 | Paper |
Space-bounded OTMs and REG ∞
Computability | 2022-02-28 | Paper |
Taming Koepke's zoo. II: Register machines
Annals of Pure and Applied Logic | 2022-01-18 | Paper |
Models of true arithmetic are integer parts of models of real exponentation
Journal of Logic and Analysis | 2021-05-26 | Paper |
How to grow it? Strategies of mathematical development presented by the example of enumerating certain set partitions
Mathematische Semesterberichte | 2021-04-19 | Paper |
| Lower bounds on $\beta(\alpha)$ and other properties of $\alpha$-ITRMs | 2021-02-26 | Paper |
Randomising Realisability
(available as arXiv preprint) | 2021-01-29 | Paper |
Space and time complexity for infinite time Turing machines
Journal Of Logic And Computation | 2020-12-15 | Paper |
Decision times of infinite computations
(available as arXiv preprint) | 2020-11-10 | Paper |
Realisability for Infinitary Intuitionistic Set Theory
(available as arXiv preprint) | 2020-09-25 | Paper |
The Lost Melody Theorem for Infinite Time Blum-Shub-Smale Machines
(available as arXiv preprint) | 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 |
scientific article; zbMATH DE number 7199593 (Why is no real title available?)
(available as arXiv preprint) | 2020-05-12 | Paper |
| scientific article; zbMATH DE number 7199593 (Why is no real title available?) | 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
(available as arXiv preprint) | 2019-06-24 | Paper |
| The Bolzano-Weierstrass theorem in generalised analysis | 2019-06-14 | Paper |
Space and Time Complexity for Infinite Time Turing Machines
(available as arXiv preprint) | 2019-05-16 | Paper |
Ordinal computability. An introduction to infinitary machines
De Gruyter Series in Logic and Its Applications | 2019-04-18 | Paper |
| scientific article; zbMATH DE number 6983478 (Why is no real title available?) | 2018-11-23 | Paper |
scientific article; zbMATH DE number 6983478 (Why is no real title available?)
(available as arXiv preprint) | 2018-11-23 | Paper |
| Taming Koepke's zoo | 2018-09-06 | Paper |
Some observations on infinitary complexity
(available as arXiv preprint) | 2018-09-06 | Paper |
RANDOMNESS VIA INFINITE COMPUTATION AND EFFECTIVE DESCRIPTIVE SET THEORY
Journal of Symbolic Logic | 2018-08-10 | Paper |
A transfer principle for second-order arithmetic, and applications
(available as arXiv preprint) | 2018-04-04 | Paper |
Reachability for infinite time Turing machines with long tapes
(available as arXiv preprint) | 2018-02-15 | Paper |
Recognizable sets and Woodin cardinals: computation beyond the constructible universe
Annals of Pure and Applied Logic | 2018-02-06 | Paper |
| Canonical Truth | 2017-12-07 | Paper |
Infinite time recognizability from generic oracles and the recognizable jump operator
Computability | 2017-11-22 | Paper |
| The recognizability strength of infinite time Turing machines with ordinal parameters | 2017-08-04 | Paper |
| Admissibles in gaps | 2017-08-04 | Paper |
| Koepke machines and satisfiability for infinitary propositional languages | 2017-08-04 | Paper |
Infinite computations with random oracles
Notre Dame Journal of Formal Logic | 2017-07-21 | Paper |
Space-Bounded OTMs and REG$^{\infty}$
(available as arXiv preprint) | 2017-07-17 | Paper |
On the value group of a model of Peano arithmetic
Forum Mathematicum | 2017-07-13 | Paper |
| How to hit on it? Introduction to mathematical problem solving | 2017-06-30 | Paper |
Randomness via infinite computation and effective descriptive set theory
(available as arXiv preprint) | 2016-12-09 | Paper |
Structures associated with real closed fields and the axiom of choice
Bulletin of the Belgian Mathematical Society - Simon Stevin | 2016-10-25 | Paper |
Structures associated with real closed fields and the axiom of choice
Bulletin of the Belgian Mathematical Society - Simon Stevin | 2016-10-25 | Paper |
Generalized effective reducibility
Pursuit of the Universal | 2016-08-17 | Paper |
Randomness and degree theory for infinite time register machines
Computability | 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
The Journal of Symbolic Logic | 2016-03-22 | Paper |
ITRM-recognizability from random oracles
Evolving Computability | 2015-10-20 | Paper |
The lost melody phenomenon
(available as arXiv preprint) | 2015-04-09 | Paper |
Algorithmic randomness for infinite time register machines
Language, Life, Limits | 2015-02-25 | Paper |
On a Diophantine representation of the predicate of provability
Journal of Mathematical Sciences (New York) | 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
Annals of Pure and Applied Logic | 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)
Bulletin of the Belgian Mathematical Society - Simon Stevin | 2013-07-11 | Paper |
| Optimal Results on ITRM-recognizability | 2013-06-21 | Paper |
| Alternative finestructural and computational approaches to constructibility | 2012-08-28 | Paper |
A Computational Approach to an Alternative Working Environment for the Constructible Universe
Models of Computation in Context | 2011-09-09 | Paper |
The basic theory of infinite time register machines
Archive for Mathematical Logic | 2010-03-02 | Paper |
A Note on OTM-Realizability and Constructive Set Theories
(available as arXiv preprint) | N/A | Paper |
Using Large Language Models for (De-)Formalization and Natural Argumentation Exercises for Beginner's Students
(available as arXiv preprint) | N/A | Paper |
Almost sure OTM-realizability
(available as arXiv preprint) | N/A | Paper |
