| Publication | Date of Publication | Type |
|---|
| Word problems and ceers | 2023-09-11 | Paper |
| Minimal degrees and downwards density in some strong positive reducibilities and quasi-reducibilities | 2023-08-03 | Paper |
| Classifying word problems of finitely generated algebras via computable reducibility | 2023-07-18 | Paper |
| Primitive recursive equivalence relations and their primitive recursive complexity | 2023-01-12 | Paper |
| Initial segments of the degrees of ceers | 2022-08-29 | Paper |
| Effective inseparability and its applications | 2022-03-22 | Paper |
| EFFECTIVE INSEPARABILITY, LATTICES, AND PREORDERING RELATIONS | 2022-02-07 | Paper |
| Self-full ceers and the uniform join operator | 2021-10-21 | Paper |
| Notes on conjunctive and Quasi degrees | 2021-09-22 | Paper |
| Punctual equivalence relations and their (punctual) complexity | 2021-09-09 | Paper |
| A note on the category of equivalence relations | 2021-05-20 | Paper |
| A note on uniform density in weak arithmetical theories | 2021-01-19 | Paper |
| Incomparability in local structures of \(s\)-degrees and \(Q\)-degrees | 2020-10-15 | Paper |
| Classifying equivalence relations in the Ershov hierarchy | 2020-10-15 | Paper |
| The theory of ceers computes true arithmetic | 2020-06-02 | Paper |
| Computing with Incomplete Information | 2020-03-04 | Paper |
| Comparing the degrees of enumerability and the closed Medvedev degrees | 2019-07-04 | Paper |
| Trial and error mathematics: Dialectical systems and completions of theories | 2019-03-01 | Paper |
| Effective inseparability, lattices, and pre-ordering relations | 2019-01-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4559854 | 2018-12-04 | Paper |
| S. Barry Cooper (1943–2015) | 2018-09-20 | Paper |
| Jumps of computably enumerable equivalence relations | 2018-01-11 | Paper |
| TRIAL AND ERROR MATHEMATICS II: DIALECTICAL SETS AND QUASIDIALECTICAL SETS, THEIR DEGREES, AND THEIR DISTRIBUTION WITHIN THE CLASS OF LIMIT SETS | 2017-05-31 | Paper |
| IN MEMORIAM: BARRY COOPER 1943–2015 | 2017-05-26 | Paper |
| The complexity of index sets of classes of computably enumerable equivalence relations | 2017-04-28 | Paper |
| A survey on universal computably enumerable equivalence relations | 2017-04-04 | Paper |
| Calibrating word problems of groups via the complexity of equivalence relations | 2016-09-12 | Paper |
| Trial and error mathematics. I: Dialectical and quasidialectical systems | 2016-07-29 | Paper |
| A note on the enumeration degrees of 1-generic sets | 2016-05-13 | Paper |
| Initial segments of the \({\Sigma}_2^0\) enumeration degrees | 2016-05-09 | Paper |
| Weakly precomplete computably enumerable equivalence relations | 2016-03-17 | Paper |
| Taking the Pirahã seriously | 2016-01-25 | Paper |
| Generalizations of the weak law of the excluded middle | 2015-07-20 | Paper |
| Friedberg numberings in the Ershov hierarchy | 2015-02-23 | Paper |
| A note on initial segments of the enumeration degrees | 2014-09-30 | Paper |
| Universal computably enumerable equivalence relations | 2014-09-30 | Paper |
| Singleton enumeration reducibility and arithmetic | 2014-04-01 | Paper |
| Positive undecidable numberings in the Ershov hierarchy | 2012-12-17 | Paper |
| Rogers semilattices of families of two embedded sets in the Ershov hierarchy | 2012-09-12 | Paper |
| Intuitionistic logic and Muchnik degrees | 2012-05-03 | Paper |
| Empty intervals in the enumeration degrees | 2012-03-13 | Paper |
| Bounded enumeration reducibility and its degree structure | 2012-02-10 | Paper |
| A note on algebras of languages | 2011-12-07 | Paper |
| Topological aspects of the Medvedev lattice | 2011-05-11 | Paper |
| Immunity properties and strong positive reducibilities | 2011-05-11 | Paper |
| Some remarks on completions of numberings | 2011-01-13 | Paper |
| Diamond embeddings into the enumeration degrees | 2010-12-01 | Paper |
| Immunity properties of the s-degrees | 2010-10-13 | Paper |
| The First Order Theories of the Medvedev and Muchnik Lattices | 2010-07-28 | Paper |
| On learning to coordinate. Random bits help, insightful normal forms, and competency isomorphisms | 2010-03-23 | Paper |
| Computation and logic in the real world: CiE 2007 | 2009-10-19 | Paper |
| Strong Positive Reducibilities | 2009-06-03 | Paper |
| High Minimal Pairs in the Enumeration Degrees | 2009-06-03 | Paper |
| Undecidability of local structures of s-degrees and Q-degrees | 2009-04-01 | Paper |
| A characterization of the δ20 hyperhyperimmune sets | 2009-01-09 | Paper |
| Isomorphism types of Rogers semilattices for families from different levels of the arithmetical hierarchy | 2008-12-18 | Paper |
| Intermediate logics and factors of the Medvedev lattice | 2008-11-12 | Paper |
| Branching in the \({\Sigma^0_2}\)-enumeration degrees: a new perspective | 2008-08-18 | Paper |
| Bounding nonsplitting enumeration degrees | 2008-02-25 | Paper |
| There exists a maximal 3-c.e. enumeration degree | 2007-09-28 | Paper |
| Properly enumeration degrees and the high/low hierarchy | 2007-01-19 | Paper |
| Elementary Theories for Rogers Semilattices | 2006-11-17 | Paper |
| Strong enumeration reducibilities | 2006-11-06 | Paper |
| ON EXTENSIONS OF EMBEDDINGS INTO THE ENUMERATION DEGREES OF THE ${\Sigma_2^0}$-SETS | 2006-04-06 | Paper |
| Bounding and nonbounding minimal pairs in the enumeration degrees | 2006-01-16 | Paper |
| On learning to coordinate: random bits help, insightful normal forms, and competency isomorphisms | 2005-10-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4460829 | 2004-03-29 | Paper |
| Density results in the \(\Delta_2^0\) e-degrees | 2003-09-16 | Paper |
| Embedding finite lattices into the Σ20 enumeration degrees | 2002-10-29 | Paper |
| Generalized computable numerations and nontrivial Rogers semilattices | 2001-07-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4513980 | 2001-07-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4946105 | 2000-12-03 | Paper |
| Structural properties and Σ20 enumeration degrees | 2000-10-08 | Paper |
| Quasi-minimal enumeration degrees and minimal Turing degrees | 2000-08-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4944900 | 2000-07-03 | Paper |
| The distribution of properly Σ20 e-degrees | 2000-05-09 | Paper |
| Branching in the enumeration degrees of the \(\Sigma_2^0\) sets | 1999-09-15 | Paper |
| Sets of generator and automorphism bases for the enumeration degrees | 1999-06-24 | Paper |
| Cupping and noncupping in the enumeration degrees of \(\Sigma_ 2^ 0\) sets | 1997-11-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4348132 | 1997-08-12 | Paper |
| Noncappable enumeration degrees below 0e′ | 1997-04-23 | Paper |
| Logic and probabilistic systems | 1996-06-11 | Paper |
| A Note on Closed Degrees of Difficulty of the Medvedev Lattice | 1996-03-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4863250 | 1996-02-04 | Paper |
| A Note on Relative Efficiency of Axiom Systems | 1995-05-14 | Paper |
| REDUCIBILITY IN SOME CATEGORIES OF PARTIAL RECURSIVE OPERATORS | 1994-08-28 | Paper |
| Comparing $∏^0_2$ sets of the Baire space by means of general recursive operators | 1993-09-27 | Paper |
| Embedding Brouwer algebra in the Medvedev lattice | 1992-06-25 | Paper |
| Some Quotient Lattices of the Medvedev Lattice | 1991-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3480026 | 1991-01-01 | Paper |
| Some remarks on the algebraic structure of the Medvedev Lattice | 1990-01-01 | Paper |
| On some filters and ideals of the Medvedev lattice | 1990-01-01 | Paper |
| Creativeness and completeness in recursion categories of partial recursive operators | 1989-01-01 | Paper |
| On Quasi-Minimal e-Degrees and Total e-Degrees | 1988-01-01 | Paper |
| Universal recursion theoretic properties of r.e. preordered structures | 1985-01-01 | Paper |
| Classifying positive equivalence relations | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3967526 | 1982-01-01 | Paper |
| \(\Sigma^ n_ 0\)-equivalence relations | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4745816 | 1982-01-01 | Paper |
