| Publication | Date of Publication | Type |
|---|
The Ginsburg-Sands theorem and computability theory
Advances in Mathematics | 2024-04-24 | Paper |
The tree pigeonhole principle in the Weihrauch degrees
| 2023-12-16 | Paper |
On the first-order parts of problems in the Weihrauch degrees
| 2023-01-30 | Paper |
On the isomorphism problem for some classes of computable algebraic structures
Archive for Mathematical Logic | 2022-07-15 | Paper |
Effectiveness for the dual Ramsey theorem
Notre Dame Journal of Formal Logic | 2022-02-14 | Paper |
Model completeness and relative decidability
Archive for Mathematical Logic | 2021-07-21 | Paper |
Minimal weak truth table degrees and computably enumerable Turing degrees
Memoirs of the American Mathematical Society | 2020-06-19 | Paper |
Lowness for isomorphism, countable ideals, and computable traceability
Mathematical Logic Quarterly | 2020-05-29 | Paper |
THE DETERMINED PROPERTY OF BAIRE IN REVERSE MATH
Journal of Symbolic Logic | 2020-04-17 | Paper |
The reverse mathematics of Hindman's theorem for sums of exactly two elements
Computability | 2020-01-17 | Paper |
Model completeness and relative decidability
| 2019-03-02 | Paper |
Effectiveness for the Dual Ramsey Theorem
| 2017-09-29 | Paper |
The uniform content of partial and linear orders
Annals of Pure and Applied Logic | 2017-08-29 | Paper |
Effectiveness of Hindman’s Theorem for Bounded Sums
Computability and Complexity | 2017-04-04 | Paper |
Ramsey's theorem for singletons and strong computable reducibility
Proceedings of the American Mathematical Society | 2016-12-29 | Paper |
Computable reductions and reverse mathematics
Pursuit of the Universal | 2016-08-17 | Paper |
Ordering free products in reverse mathematics
| 2016-01-27 | Paper |
On the effectiveness of symmetry breaking
Language, Life, Limits | 2015-02-25 | Paper |
Degrees that Are Low for Isomorphism
Computability | 2015-02-24 | Paper |
Separating principles below Ramsey's theorem for pairs
Journal of Mathematical Logic | 2014-03-10 | Paper |
Degrees of orders on torsion-free abelian groups
Annals of Pure and Applied Logic | 2013-11-29 | Paper |
Local computability for ordinals
Lecture Notes in Computer Science | 2013-08-05 | Paper |
Cappable CEA sets and Ramsey's theorem
Proceedings of the 11th Asian Logic Conference | 2013-06-03 | Paper |
Jump degrees of torsion-free abelian groups
Journal of Symbolic Logic | 2013-01-07 | Paper |
Lowness notions, measure and domination
Journal of the London Mathematical Society. Second Series | 2012-06-08 | Paper |
Reverse mathematics and infinite traceable graphs
Mathematical Logic Quarterly | 2012-02-29 | Paper |
The complexity of central series in nilpotent computable groups
Annals of Pure and Applied Logic | 2011-09-22 | Paper |
Embeddings of computable structures
Notre Dame Journal of Formal Logic | 2010-06-11 | Paper |
Self-embeddings of computable trees
Notre Dame Journal of Formal Logic | 2010-01-13 | Paper |
Stability and posets
Journal of Symbolic Logic | 2009-06-04 | Paper |
On the computability-theoretic complexity of trivial, strongly minimal models
Proceedings of the American Mathematical Society | 2007-09-27 | Paper |
scientific article; zbMATH DE number 5175706 (Why is no real title available?)
| 2007-07-30 | Paper |
Embedding finite lattices into the computably enumerable degrees -- a status survey
| 2006-10-17 | Paper |
A computably stable structure with no Scott family of finitary formulas
Archive for Mathematical Logic | 2006-09-04 | Paper |
On a conjecture of Dobrinen and Simpson concerning almost everywhere domination
| 2006-07-05 | Paper |
Computable categoricity of trees of finite height
Journal of Symbolic Logic | 2006-02-08 | Paper |
scientific article; zbMATH DE number 2236630 (Why is no real title available?)
| 2005-12-08 | Paper |
Enumerations in computable structure theory
Annals of Pure and Applied Logic | 2005-10-26 | Paper |
Reverse mathematics and the equivalence of definitions for well and better quasi-orders
Journal of Symbolic Logic | 2005-08-29 | Paper |
scientific article; zbMATH DE number 2167508 (Why is no real title available?)
| 2005-05-12 | Paper |
Effectiveness for infinite variable words and the dual Ramsey theorem
Archive for Mathematical Logic | 2004-12-16 | Paper |
Computability-theoretic and proof-theoretic aspects of partial and linear orderings
Israel Journal of Mathematics | 2004-03-17 | Paper |
Group theoretic properties of the group of computable automorphisms of a countable dense linear order
Order | 2003-06-09 | Paper |
The computable dimension of ordered abelian groups
Advances in Mathematics | 2003-05-27 | Paper |
THE LINDENBAUM ALGEBRA OF THE THEORY OF THE CLASS OF ALL FINITE MODELS
Journal of Mathematical Logic | 2003-05-15 | Paper |
\(\Pi_{1}^{0}\) classes and orderable groups
Annals of Pure and Applied Logic | 2002-08-22 | Paper |
A \(\Delta_2^0\) set with no infinite low subset in either it or its complement
The Journal of Symbolic Logic | 2002-07-18 | Paper |
On the filter of computably enumerable supersets of an r-maximal set
Archive for Mathematical Logic | 2001-12-13 | Paper |
\(\Pi_1^1\)-CA\(_0\) and order types of countable ordered groups
The Journal of Symbolic Logic | 2001-08-01 | Paper |
Reverse mathematics and fully ordered groups
Notre Dame Journal of Formal Logic | 2001-07-17 | Paper |
Ordered Groups: A Case Study in Reverse Mathematics
The Bulletin of Symbolic Logic | 1999-09-12 | Paper |
