| Publication | Date of Publication | Type |
|---|
The existential fragment of second-order propositional intuitionistic logic is undecidable
Journal of Applied Non-Classical Logics | 2024-03-20 | Paper |
On efficiency of notations for natural numbers
Theoretical Computer Science | 2022-05-31 | Paper |
Truth definition for \(\Delta_0\) formulas and PSPACE computations
Fundamenta Mathematicae | 2021-01-25 | Paper |
New bounds on the strength of some restrictions of Hindman’s Theorem
Computability | 2020-11-09 | Paper |
A modal logic of a truth definition for finite models
Fundamenta Informaticae | 2019-05-24 | Paper |
One Henkin quantifier in the empty vocabulary suffices for undecidability
Fundamenta Informaticae | 2019-05-24 | Paper |
New bounds on the strength of some restrictions of Hindman's theorem
(available as arXiv preprint) | 2017-08-04 | Paper |
On the Mints hierarchy in first-order intuitionistic logic
Logical Methods in Computer Science | 2017-04-11 | Paper |
| Second order intuitionistic propositional logic of the real line is decidable | 2016-12-21 | Paper |
On the Mints hierarchy in first-order intuitionistic logic
Lecture Notes in Computer Science | 2015-10-01 | Paper |
Collapsing modular counting in bounded arithmetic and constant depth propositional proofs
Transactions of the American Mathematical Society | 2015-09-08 | Paper |
The strength of Ramsey's theorem for coloring relatively large sets
The Journal of Symbolic Logic | 2014-09-30 | Paper |
A note on Ramsey theorems and Turing jumps
Lecture Notes in Computer Science | 2012-08-14 | Paper |
Theories of initial segments of standard models of arithmetics and their complete extensions
Theoretical Computer Science | 2011-07-18 | Paper |
Lower and upper bounds for the provability of Herbrand consistency in weak arithmetics
Fundamenta Mathematicae | 2011-03-22 | Paper |
A Tight Lower Bound for Determinization of Transition Labeled Büchi Automata
Automata, Languages and Programming | 2009-07-14 | Paper |
On a question of Andreas Weiermann
Mathematical Logic Quarterly | 2009-04-09 | Paper |
On second order intuitionistic propositional logic without a universal quantifier
Journal of Symbolic Logic | 2009-03-25 | Paper |
| scientific article; zbMATH DE number 5295812 (Why is no real title available?) | 2008-07-01 | Paper |
| scientific article; zbMATH DE number 5241977 (Why is no real title available?) | 2008-03-03 | Paper |
Computer Science Logic
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Theories of arithmetics in finite models
Journal of Symbolic Logic | 2006-02-08 | Paper |
New Computational Paradigms
Lecture Notes in Computer Science | 2006-01-11 | Paper |
Degrees of logics with Henkin quantifiers in poor vocabularies
Archive for Mathematical Logic | 2004-10-01 | Paper |
Reductions of well-ordering principles to combinatorial theorems
(available as arXiv preprint) | N/A | Paper |
