| Publication | Date of Publication | Type |
|---|
| On representations of real numbers and the computational complexity of converting between such representations | 2023-04-14 | Paper |
| On interpretability between some weak essentially undecidable theories | 2022-12-16 | Paper |
| On the complexity of conversion between classic real number representations | 2022-12-16 | Paper |
| On subrecursive representation of irrational numbers: contractors and Baire sequences | 2022-03-22 | Paper |
| Reversible programming languages capturing complexity classes | 2021-07-05 | Paper |
First-order concatenation theory with bounded quantifiers
Archive for Mathematical Logic | 2021-01-19 | Paper |
On subrecursive representability of irrational numbers, part II
Computability | 2019-10-28 | Paper |
| Decidable and undecidable fragments of first-order concatenation theory | 2018-09-06 | Paper |
Decidable and undecidable fragments of first-order concatenation theory
(available as arXiv preprint) | 2018-09-06 | Paper |
Search for good examples of Hall’s conjecture
Mathematics of Computation | 2018-08-01 | Paper |
Notes on Fragments of First-Order Concatenation Theory
(available as arXiv preprint) | 2018-04-17 | Paper |
| Subrecursive Approximations of Irrational Numbers by Variable Base Sums | 2018-04-15 | Paper |
On subrecursive representability of irrational numbers
Computability | 2017-11-22 | Paper |
A flow calculus of \(mwp\)-bounds for complexity analysis
ACM Transactions on Computational Logic | 2015-09-17 | Paper |
| A Preliminary Report on Search for Good Examples of Hall's Conjecture | 2014-01-17 | Paper |
On the edge of decidability in complexity analysis of loop programs
International Journal of Foundations of Computer Science | 2013-06-06 | Paper |
Non-determinism in Gödel's system \(T\)
Theory of Computing Systems | 2012-12-07 | Paper |
Degrees of total algorithms versus degrees of honest functions
Lecture Notes in Computer Science | 2012-08-14 | Paper |
Higher types, finite domains and resource-bounded Turing machines
Journal of Logic and Computation | 2012-05-07 | Paper |
Streamlined subrecursive degree theory
Annals of Pure and Applied Logic | 2012-03-29 | Paper |
Static complexity analysis of higher order programs
Foundational and Practical Aspects of Resource Analysis | 2010-09-14 | Paper |
Complexity classes and fragments of C
Information Processing Letters | 2009-07-09 | Paper |
Complexity-theoretic hierarchies induced by fragments of Gödel's \(T\)
Theory of Computing Systems | 2009-05-08 | Paper |
Recursion in Higher Types and Resource Bounded Turing Machines
Logic and Theory of Algorithms | 2008-06-19 | Paper |
Linear, Polynomial or Exponential? Complexity Inference in Polynomial Time
Logic and Theory of Algorithms | 2008-06-19 | Paper |
The Structure of Detour Degrees
Lecture Notes in Computer Science | 2008-05-27 | Paper |
Computer Science Logic
Lecture Notes in Computer Science | 2007-06-21 | Paper |
Logical Approaches to Computational Barriers
Lecture Notes in Computer Science | 2007-04-30 | Paper |
Theory and Applications of Models of Computation
Lecture Notes in Computer Science | 2007-04-30 | Paper |
| The countable and the over-countable | 2006-09-11 | Paper |
| Programming languages capturing complexity classes | 2006-02-08 | Paper |
New Computational Paradigms
Lecture Notes in Computer Science | 2006-01-11 | Paper |
New Computational Paradigms
Lecture Notes in Computer Science | 2006-01-11 | Paper |
Neat function algebraic characterizations of LOGSPACE and LINSPACE
Computational Complexity | 2005-06-16 | Paper |
Subrecursive degrees and fragments of Peano arithmetic
Archive for Mathematical Logic | 2002-03-19 | Paper |
| scientific article; zbMATH DE number 1507242 (Why is no real title available?) | 2000-11-09 | Paper |
| scientific article; zbMATH DE number 1234436 (Why is no real title available?) | 1999-06-07 | Paper |
A jump operator on honest subrecursive degrees
Archive for Mathematical Logic | 1998-08-10 | Paper |
| scientific article; zbMATH DE number 922628 (Why is no real title available?) | 1997-06-26 | Paper |
Notes on Interpretability between Weak First-order Theories: Theories of Sequences
(available as arXiv preprint) | N/A | Paper |
