| Publication | Date of Publication | Type |
|---|
Word problems and ceers
Mathematical Logic Quarterly | 2023-09-11 | Paper |
Minimal degrees and downwards density in some strong positive reducibilities and quasi-reducibilities
Journal Of Logic And Computation | 2023-08-03 | Paper |
Classifying word problems of finitely generated algebras via computable reducibility
International Journal of Algebra and Computation | 2023-07-18 | Paper |
Primitive recursive equivalence relations and their primitive recursive complexity
Computability | 2023-01-12 | Paper |
Initial segments of the degrees of ceers
Journal of Symbolic Logic | 2022-08-29 | Paper |
| Effective inseparability and its applications | 2022-03-22 | Paper |
EFFECTIVE INSEPARABILITY, LATTICES, AND PREORDERING RELATIONS
The Review of Symbolic Logic | 2022-02-07 | Paper |
Self-full ceers and the uniform join operator
Journal Of Logic And Computation | 2021-10-21 | Paper |
Notes on conjunctive and Quasi degrees
Journal Of Logic And Computation | 2021-09-22 | Paper |
Punctual equivalence relations and their (punctual) complexity
(available as arXiv preprint) | 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
Archive for Mathematical Logic | 2021-01-19 | Paper |
Incomparability in local structures of \(s\)-degrees and \(Q\)-degrees
Archive for Mathematical Logic | 2020-10-15 | Paper |
Classifying equivalence relations in the Ershov hierarchy
Archive for Mathematical Logic | 2020-10-15 | Paper |
The theory of ceers computes true arithmetic
Annals of Pure and Applied Logic | 2020-06-02 | Paper |
| Computing with Incomplete Information | 2020-03-04 | Paper |
Comparing the degrees of enumerability and the closed Medvedev degrees
Archive for Mathematical Logic | 2019-07-04 | Paper |
Trial and error mathematics: Dialectical systems and completions of theories
Journal Of Logic And Computation | 2019-03-01 | Paper |
Trial and error mathematics: Dialectical systems and completions of theories
Journal Of Logic And Computation | 2019-03-01 | Paper |
Effective inseparability, lattices, and pre-ordering relations
(available as arXiv preprint) | 2019-01-18 | Paper |
| scientific article; zbMATH DE number 6988793 (Why is no real title available?) | 2018-12-04 | Paper |
S. Barry Cooper (1943–2015)
Computability | 2018-09-20 | Paper |
Jumps of computably enumerable equivalence relations
Annals of Pure and Applied Logic | 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
The Review of Symbolic Logic | 2017-05-31 | Paper |
IN MEMORIAM: BARRY COOPER 1943–2015
The Bulletin of Symbolic Logic | 2017-05-26 | Paper |
The complexity of index sets of classes of computably enumerable equivalence relations
Journal of Symbolic Logic | 2017-04-28 | Paper |
A survey on universal computably enumerable equivalence relations
Computability and Complexity | 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
The Review of Symbolic Logic | 2016-07-29 | Paper |
A note on the enumeration degrees of 1-generic sets
Archive for Mathematical Logic | 2016-05-13 | Paper |
Initial segments of the \({\Sigma}_2^0\) enumeration degrees
The Journal of Symbolic Logic | 2016-05-09 | Paper |
Weakly precomplete computably enumerable equivalence relations
Mathematical Logic Quarterly (MLQ) | 2016-03-17 | Paper |
Taking the Pirahã seriously
Communications in Nonlinear Science and Numerical Simulation | 2016-01-25 | Paper |
Generalizations of the weak law of the excluded middle
Notre Dame Journal of Formal Logic | 2015-07-20 | Paper |
Generalizations of the weak law of the excluded middle
Notre Dame Journal of Formal Logic | 2015-07-20 | Paper |
Friedberg numberings in the Ershov hierarchy
Archive for Mathematical Logic | 2015-02-23 | Paper |
A note on initial segments of the enumeration degrees
The Journal of Symbolic Logic | 2014-09-30 | Paper |
Universal computably enumerable equivalence relations
The Journal of Symbolic Logic | 2014-09-30 | Paper |
Singleton enumeration reducibility and arithmetic
Journal Of Logic And Computation | 2014-04-01 | Paper |
Positive undecidable numberings in the Ershov hierarchy
Algebra and Logic | 2012-12-17 | Paper |
Rogers semilattices of families of two embedded sets in the Ershov hierarchy
Mathematical Logic Quarterly (MLQ) | 2012-09-12 | Paper |
Intuitionistic logic and Muchnik degrees
Algebra Universalis | 2012-05-03 | Paper |
Empty intervals in the enumeration degrees
Annals of Pure and Applied Logic | 2012-03-13 | Paper |
Bounded enumeration reducibility and its degree structure
Archive for Mathematical Logic | 2012-02-10 | Paper |
A note on algebras of languages
Theoretical Computer Science | 2011-12-07 | Paper |
Topological aspects of the Medvedev lattice
Archive for Mathematical Logic | 2011-05-11 | Paper |
Immunity properties and strong positive reducibilities
Archive for Mathematical Logic | 2011-05-11 | Paper |
| Some remarks on completions of numberings | 2011-01-13 | Paper |
| Some remarks on completions of numberings | 2011-01-13 | Paper |
Diamond embeddings into the enumeration degrees
Mathematical Structures in Computer Science | 2010-12-01 | Paper |
Immunity properties of the s-degrees
gmj | 2010-10-13 | Paper |
The First Order Theories of the Medvedev and Muchnik Lattices
Mathematical Theory and Computational Practice | 2010-07-28 | Paper |
On learning to coordinate. Random bits help, insightful normal forms, and competency isomorphisms
Lecture Notes in Computer Science | 2010-03-23 | Paper |
Computation and logic in the real world: CiE 2007
Theory of Computing Systems | 2009-10-19 | Paper |
Strong Positive Reducibilities
Lecture Notes in Computer Science | 2009-06-03 | Paper |
High Minimal Pairs in the Enumeration Degrees
Lecture Notes in Computer Science | 2009-06-03 | Paper |
Undecidability of local structures of s-degrees and Q-degrees
Tbilisi Mathematical Journal | 2009-04-01 | Paper |
A characterization of the δ20 hyperhyperimmune sets
Journal of Symbolic Logic | 2009-01-09 | Paper |
Isomorphism types of Rogers semilattices for families from different levels of the arithmetical hierarchy
Algebra and Logic | 2008-12-18 | Paper |
Intermediate logics and factors of the Medvedev lattice
Annals of Pure and Applied Logic | 2008-11-12 | Paper |
Branching in the \({\Sigma^0_2}\)-enumeration degrees: a new perspective
Archive for Mathematical Logic | 2008-08-18 | Paper |
Bounding nonsplitting enumeration degrees
Journal of Symbolic Logic | 2008-02-25 | Paper |
There exists a maximal 3-c.e. enumeration degree
Israel Journal of Mathematics | 2007-09-28 | Paper |
Properly enumeration degrees and the high/low hierarchy
Journal of Symbolic Logic | 2007-01-19 | Paper |
Elementary Theories for Rogers Semilattices
Algebra and Logic | 2006-11-17 | Paper |
Strong enumeration reducibilities
Archive for Mathematical Logic | 2006-11-06 | Paper |
ON EXTENSIONS OF EMBEDDINGS INTO THE ENUMERATION DEGREES OF THE ${\Sigma_2^0}$-SETS
Journal of Mathematical Logic | 2006-04-06 | Paper |
Bounding and nonbounding minimal pairs in the enumeration degrees
Journal of Symbolic Logic | 2006-01-16 | Paper |
On learning to coordinate: random bits help, insightful normal forms, and competency isomorphisms
Journal of Computer and System Sciences | 2005-10-10 | Paper |
| scientific article; zbMATH DE number 2063214 (Why is no real title available?) | 2004-03-29 | Paper |
Density results in the \(\Delta_2^0\) e-degrees
Archive for Mathematical Logic | 2003-09-16 | Paper |
Embedding finite lattices into the Σ20 enumeration degrees
Journal of Symbolic Logic | 2002-10-29 | Paper |
Generalized computable numerations and nontrivial Rogers semilattices
Algebra i Logika | 2001-07-24 | Paper |
| scientific article; zbMATH DE number 1531937 (Why is no real title available?) | 2001-07-09 | Paper |
| scientific article; zbMATH DE number 1421079 (Why is no real title available?) | 2000-12-03 | Paper |
Structural properties and Σ20 enumeration degrees
Journal of Symbolic Logic | 2000-10-08 | Paper |
Quasi-minimal enumeration degrees and minimal Turing degrees
Annali di Matematica Pura ed Applicata. Serie Quarta | 2000-08-20 | Paper |
| scientific article; zbMATH DE number 1420832 (Why is no real title available?) | 2000-07-03 | Paper |
The distribution of properly Σ20 e-degrees
Journal of Symbolic Logic | 2000-05-09 | Paper |
Branching in the enumeration degrees of the \(\Sigma_2^0\) sets
Israel Journal of Mathematics | 1999-09-15 | Paper |
Sets of generator and automorphism bases for the enumeration degrees
Annals of Pure and Applied Logic | 1999-06-24 | Paper |
Cupping and noncupping in the enumeration degrees of \(\Sigma_ 2^ 0\) sets
Annals of Pure and Applied Logic | 1997-11-05 | Paper |
| scientific article; zbMATH DE number 1048046 (Why is no real title available?) | 1997-08-12 | Paper |
Noncappable enumeration degrees below 0e′
Journal of Symbolic Logic | 1997-04-23 | Paper |
Logic and probabilistic systems
Archive for Mathematical Logic | 1996-06-11 | Paper |
A Note on Closed Degrees of Difficulty of the Medvedev Lattice
Mathematical Logic Quarterly | 1996-03-06 | Paper |
| scientific article; zbMATH DE number 841094 (Why is no real title available?) | 1996-02-04 | Paper |
A Note on Relative Efficiency of Axiom Systems
Mathematical Logic Quarterly | 1995-05-14 | Paper |
REDUCIBILITY IN SOME CATEGORIES OF PARTIAL RECURSIVE OPERATORS
Mathematical Logic Quarterly | 1994-08-28 | Paper |
Comparing $∏^0_2$ sets of the Baire space by means of general recursive operators
Fundamenta Mathematicae | 1993-09-27 | Paper |
Embedding Brouwer algebra in the Medvedev lattice
Notre Dame Journal of Formal Logic | 1992-06-25 | Paper |
Some Quotient Lattices of the Medvedev Lattice
Mathematical Logic Quarterly | 1991-01-01 | Paper |
| scientific article; zbMATH DE number 4150135 (Why is no real title available?) | 1991-01-01 | Paper |
Some remarks on the algebraic structure of the Medvedev Lattice
Journal of Symbolic Logic | 1990-01-01 | Paper |
On some filters and ideals of the Medvedev lattice
Archive for Mathematical Logic | 1990-01-01 | Paper |
Creativeness and completeness in recursion categories of partial recursive operators
Journal of Symbolic Logic | 1989-01-01 | Paper |
On Quasi-Minimal e-Degrees and Total e-Degrees
Proceedings of the American Mathematical Society | 1988-01-01 | Paper |
Universal recursion theoretic properties of r.e. preordered structures
Journal of Symbolic Logic | 1985-01-01 | Paper |
Classifying positive equivalence relations
Journal of Symbolic Logic | 1983-01-01 | Paper |
| scientific article; zbMATH DE number 3790416 (Why is no real title available?) | 1982-01-01 | Paper |
\(\Sigma^ n_ 0\)-equivalence relations
Studia Logica | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3801524 (Why is no real title available?) | 1982-01-01 | Paper |
