| Publication | Date of Publication | Type |
|---|
The Logic of Correct Models
(available as arXiv preprint) | N/A | Paper |
The logic of correct models
Journal of Mathematical Logic | 2026-07-13 | Paper |
On Nash-Williams' theorem regarding sequences with finite range
Transactions of the American Mathematical Society | 2026-07-07 | Paper |
| Automatic structures and the problem of natural well-orderings | 2026-04-29 | Paper |
Well-quasi-orders on finite trees and transfinite sequences
(available as arXiv preprint) | 2026-01-01 | Paper |
Speedups for Presburger Arithmetic and Real Closed Fields
(available as arXiv preprint) | 2026-01-01 | Paper |
Lévy-Montague reflection is $Π^1_1$-conservative over $\mathsf{WKL}_0$
(available as arXiv preprint) | 2026-01-01 | Paper |
Infinitary provability logic
(available as arXiv preprint) | 2026-01-01 | Paper |
A Reflection Calculus for Bar Induction and the Linearity of Consistency Strength Ordering
(available as arXiv preprint) | 2026-01-01 | Paper |
Feferman's completeness theorem
The Bulletin of Symbolic Logic | 2025-11-18 | Paper |
Provable better-quasi-orders
Notre Dame Journal of Formal Logic | 2025-08-01 | Paper |
The logical strength of minimal bad arrays
Proceedings of the American Mathematical Society | 2025-01-08 | Paper |
Ranking theories via encoded \beta-models
(available as arXiv preprint) | 2025-01-01 | Paper |
Generalized Higman's Theorem and iterated ideals
(available as arXiv preprint) | 2025-01-01 | Paper |
Correction to: ``Arithmetical and hyperarithmetical worm battles''
Journal Of Logic And Computation | 2024-11-12 | Paper |
There are no minimal essentially undecidable theories
Journal Of Logic And Computation | 2024-11-12 | Paper |
Functorial Fast-Growing Hierarchies
Forum of Mathematics, Sigma | 2024-02-07 | Paper |
Feferman's completeness theorem
(available as arXiv preprint) | 2024-01-01 | Paper |
On Nash-Williams' Theorem regarding sequences with finite range
(available as arXiv preprint) | 2024-01-01 | Paper |
Automatic structures and the problem of natural well-orderings
(available as arXiv preprint) | 2024-01-01 | Paper |
Generalized fusible numbers and their ordinals
Annals of Pure and Applied Logic | 2023-10-12 | Paper |
Finitely axiomatized theories lack self‐comprehension
Bulletin of the London Mathematical Society | 2023-09-20 | Paper |
On the coprimeness relation from the viewpoint of monadic second-order logic
Izvestiya: Mathematics | 2023-09-02 | Paper |
The Π21\Pi ^1_2 consequences of a theory
Journal of the London Mathematical Society | 2023-08-23 | Paper |
| Provable better quasi orders | 2023-05-01 | Paper |
| The logical strength of minimal bad arrays | 2023-04-01 | Paper |
Arithmetical and Hyperarithmetical Worm Battles
Journal Of Logic And Computation | 2023-01-04 | Paper |
| Linear Orders in Presburger Arithmetic | 2022-09-23 | Paper |
| How to escape Tennenbaum's theorem | 2022-09-02 | Paper |
| There are no minimal essentially undecidable Theories | 2022-07-17 | Paper |
Reflection algebras and conservation results for theories of iterated truth
Annals of Pure and Applied Logic | 2022-04-01 | Paper |
How to escape Tennenbaum's theorem
(available as arXiv preprint) | 2022-01-01 | Paper |
Linear Orders in Presburger Arithmetic
(available as arXiv preprint) | 2022-01-01 | Paper |
Multi-dimensional Interpretations of Presburger Arithmetic in Itself
Journal Of Logic And Computation | 2020-12-15 | Paper |
Short proofs for slow consistency
Notre Dame Journal of Formal Logic | 2020-05-04 | Paper |
Short proofs for slow consistency
Notre Dame Journal of Formal Logic | 2020-05-04 | Paper |
Multi-Dimensional Interpretations of Presburger Arithmetic in Itself
(available as arXiv preprint) | 2020-04-05 | Paper |
Complexity of the interpretability logic IL
Logic Journal of the IGPL | 2019-11-04 | Paper |
Reflection algebras and conservation results for theories of iterated truth
(available as arXiv preprint) | 2019-08-27 | Paper |
Truth, disjunction, and induction
Archive for Mathematical Logic | 2019-07-04 | Paper |
| A weak set theory that proves its own consistency | 2019-07-01 | Paper |
On a question of Krajewski's
Journal of Symbolic Logic | 2019-03-15 | Paper |
A weak set theory that proves its own consistency
(available as arXiv preprint) | 2019-01-01 | Paper |
Reflection ranks and ordinal analysis
(available as arXiv preprint) | 2018-05-05 | Paper |
Interpretations of Presburger arithmetic in itself
(available as arXiv preprint) | 2018-04-06 | Paper |
Solovay's completeness without fixed points
(available as arXiv preprint) | 2017-12-20 | Paper |
Linear \(\mathrm{GLP}\)-algebras and their elementary theories
Izvestiya: Mathematics | 2017-03-08 | Paper |
On elementary theories of ordinal notation systems based on reflection principles
Proceedings of the Steklov Institute of Mathematics | 2016-05-10 | Paper |
| Slow and Ordinary Provability for Peano Arithmetic | 2016-02-04 | Paper |
Slow and Ordinary Provability for Peano Arithmetic
(available as arXiv preprint) | 2016-01-01 | Paper |
| Ordinal Notations in Caucal Hierarchy | 2015-12-15 | Paper |
Ordinal Notations in Caucal Hierarchy
(available as arXiv preprint) | 2015-01-01 | Paper |
On the complexity of the closed fragment of Japaridze's provability logic
Archive for Mathematical Logic | 2014-12-15 | Paper |
| On Elementary Theories of GLP-Algebras | 2014-12-14 | Paper |
On Elementary Theories of GLP-Algebras
(available as arXiv preprint) | 2014-01-01 | Paper |
Undecidability of the elementary theory of the semilattice of GLP-words
Sbornik: Mathematics | 2012-11-23 | Paper |
