| Publication | Date of Publication | Type |
|---|
A causal inference framework for cancer cluster investigations using publicly available data
Journal of the Royal Statistical Society. Series A. Statistics in Society | 2025-01-22 | Paper |
Conservation strength of the infinite pigeonhole principle for trees
Israel Journal of Mathematics | 2024-06-25 | Paper |
Lagrangian dynamics and regularity of the spin Euler equation
Journal of Fluid Mechanics | 2024-05-06 | Paper |
| Isola and mushroom dynamics of limit cycles and bifurcations in a predator-prey system with additive Allee effect | 2023-11-03 | Paper |
Minimal degrees and downwards density in some strong positive reducibilities and quasi-reducibilities
Journal Of Logic And Computation | 2023-08-03 | Paper |
| On the Nonexistence of a Strong Minimal Pair | 2022-11-20 | Paper |
A recursion theoretic foundation of computation over real numbers
Journal Of Logic And Computation | 2021-11-09 | Paper |
The strength of Ramsey's theorem for pairs over trees. I: Weak König's lemma
Transactions of the American Mathematical Society | 2021-08-02 | Paper |
Incomparability in local structures of \(s\)-degrees and \(Q\)-degrees
Archive for Mathematical Logic | 2020-10-15 | Paper |
Degrees containing members of thin \(\Pi_1^0\) classes are dense and co-dense
Journal of Mathematical Logic | 2018-06-13 | Paper |
Optimal depth-first algorithms and equilibria of independent distributions on multi-branching trees
Information Processing Letters | 2017-06-13 | Paper |
The inductive strength of Ramsey's theorem for pairs
Advances in Mathematics | 2017-02-03 | Paper |
The members of thin and minimal \(\Pi_1^0\) classes, their ranks and Turing degrees
Annals of Pure and Applied Logic | 2015-05-15 | Paper |
Nonstandard models in recursion theory and reverse mathematics
The Bulletin of Symbolic Logic | 2014-10-21 | Paper |
The metamathematics of Stable Ramsey’s Theorem for Pairs
Journal of the American Mathematical Society | 2014-09-19 | Paper |
\(\varPi^1_1\)-conservation of combinatorial principles weaker than Ramsey's theorem for pairs
Advances in Mathematics | 2012-07-20 | Paper |
Diamond embeddings into the enumeration degrees
Mathematical Structures in Computer Science | 2010-12-01 | Paper |
| Turing degrees and the Ershov hierarchy | 2010-06-17 | Paper |
On the role of the collection principle for \(\Sigma ^0_2\)-formulas in second-order reverse mathematics
Proceedings of the American Mathematical Society | 2010-03-31 | Paper |
High Minimal Pairs in the Enumeration Degrees
Lecture Notes in Computer Science | 2009-06-03 | Paper |
Computable categoricity and the Ershov hierarchy
Annals of Pure and Applied Logic | 2008-12-05 | Paper |
There exists a maximal 3-c.e. enumeration degree
Israel Journal of Mathematics | 2007-09-28 | Paper |
The jump of a Σ n -cut
Journal of the London Mathematical Society | 2007-09-27 | Paper |
Theory and Applications of Models of Computation
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 |
On Σ1-Structural Differences Among Finite Levels of the Ershov Hierarchy
Journal of Symbolic Logic | 2007-01-19 | Paper |
Properly enumeration degrees and the high/low hierarchy
Journal of Symbolic Logic | 2007-01-19 | Paper |
Bounding computably enumerable degrees in the Ershov hierarchy
Annals of Pure and Applied Logic | 2006-08-16 | Paper |
On the definable ideal generated by nonbounding c.e. degrees
Journal of Symbolic Logic | 2006-02-08 | Paper |
Bounding and nonbounding minimal pairs in the enumeration degrees
Journal of Symbolic Logic | 2006-01-16 | Paper |
The existence of high nonbounding degrees in the difference hierarchy
Annals of Pure and Applied Logic | 2005-12-29 | Paper |
| scientific article; zbMATH DE number 2236629 (Why is no real title available?) | 2005-12-08 | Paper |
Properly ?2 minimal degrees and 0? complementation
MLQ | 2005-06-01 | Paper |
The minimal e-degree problem in fragments of Peano arithmetic
Annals of Pure and Applied Logic | 2005-01-31 | Paper |
A join theorem for the computably enumerable degrees
Transactions of the American Mathematical Society | 2004-08-13 | Paper |
| scientific article; zbMATH DE number 2063225 (Why is no real title available?) | 2004-03-29 | Paper |
| Recursion theory on weak fragments of Peano arithmetic: A study of definable cuts | 2002-07-18 | Paper |
A nonlow\(_2\) r. e. degree with the extension of embeddings properties of a low\(_2\) degree
Mathematical Logic Quarterly (MLQ) | 2002-05-15 | Paper |
\(\Sigma_2\) induction and infinite injury priority arguments. III: Prompt sets, minimal pairs and Shoenfield's conjecture
Israel Journal of Mathematics | 2001-07-31 | Paper |
| scientific article; zbMATH DE number 1531922 (Why is no real title available?) | 2001-06-04 | Paper |
| scientific article; zbMATH DE number 1420838 (Why is no real title available?) | 2001-02-05 | Paper |
| scientific article; zbMATH DE number 1421082 (Why is no real title available?) | 2000-12-17 | Paper |
Σ2 Induction and infinite injury priority argument, Part I: Maximal sets and the jump operator
Journal of Symbolic Logic | 1999-02-02 | Paper |
\(\Sigma_ 2\) induction and infinite injury priority arguments. II. Tame \(\Sigma_ 2\) coding and the jump operator
Annals of Pure and Applied Logic | 1998-01-26 | Paper |
Iterated trees and fragments of arithmetic
Archive for Mathematical Logic | 1995-11-28 | Paper |
The thickness lemma from P− + IΣ1 + ¬BΣ2
Journal of Symbolic Logic | 1995-08-15 | Paper |
