| Publication | Date of Publication | Type |
|---|
On linearly ordered sets of chain components
Qualitative Theory of Dynamical Systems | 2026-05-28 | Paper |
On linearly ordered sets of chain components
(available as arXiv preprint) | 2026-01-01 | Paper |
Rigid many-one degrees contain infinite antichains of 1-degrees
(available as arXiv preprint) | 2026-01-01 | Paper |
m-Rigidity and Finite-One Degrees Inside Typical Many-One Degrees
(available as arXiv preprint) | 2026-01-01 | Paper |
A $wtt$-introimmune set in \texorpdfstring{$Π^0_1$}{Pi01} and introimmunity for several reducibilities
(available as arXiv preprint) | 2026-01-01 | Paper |
Dense Chains, Antichains, and Universal Partial Orders Inside a Bounded Finite-One Degree
(available as arXiv preprint) | 2026-01-01 | Paper |
A computably enumerable many-one degree with no least finite-one degree
(available as arXiv preprint) | 2026-01-01 | Paper |
\texorpdfstring{$D$}{D}-maximal many-one degrees contain least finite-one degrees
(available as arXiv preprint) | 2026-01-01 | Paper |
A Computably Enumerable tt-Degree Without Computably Enumerable Irreducible m-Degrees
(available as arXiv preprint) | 2026-01-01 | Paper |
Every Nonrecursive Many-One Degree Contains Either One or Infinitely Many Finite-One Degrees
(available as arXiv preprint) | 2026-01-01 | Paper |
A Bounded Finite-One Degree Whose One-One Degrees Form Exactly a Dense Linear Order
(available as arXiv preprint) | 2026-01-01 | Paper |
Every introenumerable set contains a uniformly introreducible subset
(available as arXiv preprint) | 2026-01-01 | Paper |
Pseudo-Hyperjump Inversion Fails for Turing Degrees
(available as arXiv preprint) | 2026-01-01 | Paper |
A Special Π^0_1 Class with the Join Property but without Pseudojump Inversion
(available as arXiv preprint) | 2026-01-01 | Paper |
Cone Avoidance and the No-Least-Join Theorem
(available as arXiv preprint) | 2026-01-01 | Paper |
Reconstruction of Finite Posets of Width Three
(available as arXiv preprint) | 2026-01-01 | Paper |
Degrees of sets having no subsets of higher m- and t t-degree
Computability | 2021-11-18 | Paper |
Corrigendum to “Sets with no subsets of higher weak truth-table degree”, Reports on Mathematical Logic, 53 (2018), 3–17
Reports on Mathematical Logic | 2020-09-22 | Paper |
Sets with no subsets of higher weak truth-table degree
Reports on Mathematical Logic | 2019-03-11 | Paper |
Revisiting a result of Ko
Information Processing Letters | 2016-05-26 | Paper |
Low sets without subsets of higher many-one degree
Mathematical Logic Quarterly | 2011-11-07 | Paper |
Sets without subsets of higher many-one degree
Notre Dame Journal of Formal Logic | 2005-09-28 | Paper |
Polynomial time introreducibility
Theory of Computing Systems | 2003-08-26 | Paper |
The Helping Hierarchy
RAIRO - Theoretical Informatics and Applications | 2001-01-01 | Paper |
The Helping Hierarchy
RAIRO - Theoretical Informatics and Applications | 2001-01-01 | Paper |
Helping by unambiguous computation and probabilistic computation
Theory of Computing Systems | 1997-11-18 | Paper |
\(\Sigma_ 1^ 1\)-completeness of a fragment of the theory of trees with subtree relation
Notre Dame Journal of Formal Logic | 1995-09-28 | Paper |
