Mariya Ivanova Soskova

André Nies

J. Symb. Log., 2023

Pa Relative to an Enumeration Oracle.

[BibT_eX]

[DOI]

Jun Le Goh

J. Symb. Log., 2023

Expanding the Reals by continuous Functions Adds no Computational Power.

[BibT_eX]

[DOI]

J. Symb. Log., 2023

Minimal covers in the Weihrauch degrees.

[BibT_eX]

[DOI]

Arno Pauly

Manlio Valenti

CoRR, 2023

The Relationship Between Local and Global Structure in the Enumeration Degrees.

[BibT_eX]

[DOI]

Hristo Aleksndrov Ganchev

Proceedings of the Unity of Logic and Computation, 2023

2022

A Structural Dichotomy in the Enumeration Degrees.

[BibT_eX]

[DOI]

J. Symb. Log., 2022

Extensions of two constructions of Ahmad.

[BibT_eX]

[DOI]

Jun Le Goh

Keng Meng Ng

Comput., 2022

Preface of the Special Issue for the Oberwolfach Workshop on Computability Theory 2021.

[BibT_eX]

[DOI]

Vasco Brattka

Noam Greenberg

Comput., 2022

2021

Descriptive Set Theory and Computable Topology (Dagstuhl Seminar 21461).

[BibT_eX]

[DOI]

Mathieu Hoyrup

Arno Pauly

Victor L. Selivanov

Dagstuhl Reports, 2021

2018

Enumeration 1-Genericity in the Local Enumeration Degrees.

[BibT_eX]

[DOI]

Liliana Badillo

Charles M. Harris

Hristo Aleksndrov Ganchev

Notre Dame J. Formal Log., 2018

The jump hierarchy in the enumeration degrees.

[BibT_eX]

[DOI]

Comput., 2018

S. Barry Cooper (1943-2015).

[BibT_eX]

[DOI]

Peter van Emde Boas

Stanley S. Wainer

Comput., 2018

Corrigendum to "Advice classes of parameterized tractability" [Ann. Pure Appl. Logic 84 (1) (1997) 119-138].

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 2018

2017

Enumeration Reducibility and Computable Structure Theory.

[BibT_eX]

[DOI]

Alexandra A. Soskova

Proceedings of the Computability and Complexity, 2017

Nondensity of Double Bubbles in the D.C.E. Degrees.

[BibT_eX]

[DOI]

Uri Andrews

Rutger Kuyper

Mars M. Yamaleev

Proceedings of the Computability and Complexity, 2017

Introduction.

[BibT_eX]

[DOI]

Proceedings of the Incomputable: Journeys Beyond the Turing Barrier, 2017

2016

On Kalimullin pairs.

[BibT_eX]

[DOI]

Mingzhong Cai

Comput., 2016

The automorphism group of the enumeration degrees.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 2016

2013

The incomputable.

[BibT_eX]

[DOI]

J. Log. Comput., 2013

The Turing Universe in the Context of Enumeration Reducibility.

[BibT_eX]

[DOI]

Proceedings of the Nature of Computation. Logic, Algorithms, Applications, 2013

2012

Embedding countable partial orderings in the enumeration degrees and the ω-enumeration degrees.

[BibT_eX]

[DOI]

Ivan N. Soskov

J. Log. Comput., 2012

Embedding distributive lattices in the Σ02 enumeration degrees.

[BibT_eX]

[DOI]

J. Log. Comput., 2012

Interpreting true arithmetic in the local structure of the enumeration degrees.

[BibT_eX]

[DOI]

J. Symb. Log., 2012

Cupping and definability in the local structure of the enumeration degrees.

[BibT_eX]

[DOI]

J. Symb. Log., 2012

The high/low hierarchy in the local structure of the omega-enumeration degrees.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 2012

2011

Splitting and nonsplitting in the Σ20 enumeration degrees.

[BibT_eX]

[DOI]

Marat M. Arslanov

Theor. Comput. Sci., 2011

Kalimullin Pairs of §02 w-Enumeration Degrees.

[BibT_eX]

[DOI]

Ivan N. Soskov

Int. J. Softw. Informatics, 2011

2010

The limitations of cupping in the local structure of the enumeration degrees.

[BibT_eX]

[DOI]

Arch. Math. Log., 2010

2009

Cupping Delta20 enumeration degrees to 0 e'.

[BibT_eX]

[DOI]

Guohua Wu

Math. Struct. Comput. Sci., 2009

A non-splitting theorem in the enumeration degrees.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 2009

2008

How enumeration reducibility yields extended Harrington non-splitting.

[BibT_eX]

[DOI]

J. Symb. Log., 2008

Randomness, lowness and degrees.

[BibT_eX]

[DOI]

George Barmpalias

Andrew E. M. Lewis

J. Symb. Log., 2008

Total Degrees and Nonsplitting Properties of Enumeration Degrees.

[BibT_eX]

[DOI]

Marat M. Arslanov

Proceedings of the Theory and Applications of Models of Computation, 2008

Cupping Classes of Enumeration Degrees.

[BibT_eX]

[DOI]

Proceedings of the Logic and Theory of Algorithms, 2008

2007

Genericity and Non-bounding in the Enumeration degrees.

[BibT_eX]

[DOI]

J. Log. Comput., 2007

The Strongest Nonsplitting Theorem.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2007

Working with the LR Degrees.

[BibT_eX]

[DOI]

George Barmpalias

Andrew E. M. Lewis

Proceedings of the Theory and Applications of Models of Computation, 2007

Cupping D20 Enumeration Degrees to 0 e '.

[BibT_eX]

[DOI]

Guohua Wu

Proceedings of the Computation and Logic in the Real World, 2007

2006

A Generic Set That Does Not Bound a Minimal Pair.

[BibT_eX]

[DOI]