| Publication | Date of Publication | Type |
|---|
Regressive versions of Hindman's theorem
Archive for Mathematical Logic | 2024-04-16 | Paper |
The Adjacent Hindman’s Theorem for uncountable groups
Colloquium Mathematicum | 2023-11-09 | Paper |
Hindman's theorem for sums along the full binary tree, \(\Sigma^0_2\)-induction and the pigeonhole principle for trees
Archive for Mathematical Logic | 2022-07-15 | Paper |
Restrictions of Hindman's theorem: an overview
| 2022-03-22 | Paper |
Upper bounds on positional Paris-Harrington games
Discrete Mathematics | 2021-01-27 | Paper |
New bounds on the strength of some restrictions of Hindman’s Theorem
Computability | 2020-11-09 | Paper |
A note on the ordinal analysis of \(\mathrm{RCA}_0+\mathrm{WO}(\mathbf{\sigma})\)
| 2020-05-12 | Paper |
A note on Hindman-type theorems for uncountable cardinals
Order | 2019-03-25 | Paper |
A weak variant of Hindman's theorem stronger than Hilbert's theorem
Archive for Mathematical Logic | 2018-04-17 | Paper |
``Weak yet strong restrictions of Hindman's finite sums theorem
Proceedings of the American Mathematical Society | 2017-12-08 | Paper |
New bounds on the strength of some restrictions of Hindman's theorem
| 2017-08-04 | Paper |
On the proof complexity of Paris-Harrington and off-diagonal Ramsey tautologies
ACM Transactions on Computational Logic | 2017-07-13 | Paper |
The strength of Ramsey's theorem for coloring relatively large sets
The Journal of Symbolic Logic | 2014-09-30 | Paper |
Learning with ordinal-bounded memory from positive data
Journal of Computer and System Sciences | 2012-08-17 | Paper |
A note on Ramsey theorems and Turing jumps
Lecture Notes in Computer Science | 2012-08-14 | Paper |
Unprovability results involving braids
Proceedings of the London Mathematical Society | 2011-01-19 | Paper |
Sharp thresholds for hypergraph regressive Ramsey numbers
Journal of Combinatorial Theory. Series A | 2011-01-14 | Paper |
Incremental Learning with Ordinal Bounded Example Memory
Lecture Notes in Computer Science | 2009-12-01 | Paper |
Learning correction grammars
Journal of Symbolic Logic | 2009-06-04 | Paper |
Non-U-shaped vacillatory and team learning
Journal of Computer and System Sciences | 2008-06-10 | Paper |
Learning Correction Grammars
Learning Theory | 2008-01-03 | Paper |
Results on memory-limited U-shaped learning
Information and Computation | 2007-10-10 | Paper |
Memory-Limited U-Shaped Learning
Learning Theory | 2007-09-14 | Paper |
Algorithmic Learning Theory
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Variations on U-shaped learning
Information and Computation | 2006-08-17 | Paper |
Learning Theory
Lecture Notes in Computer Science | 2006-06-22 | Paper |
Worms, gaps, and hydras
MLQ | 2005-08-01 | Paper |
A new proof-theoretic proof of the independence of Kirby-Paris' hydra theorem.
Theoretical Computer Science | 2003-07-30 | Paper |
Reductions of well-ordering principles to combinatorial theorems
| N/A | Paper |
