Relative enumerability in the difference hierarchy-Reference-Cited by-同舟云学术

Relative enumerability in the difference hierarchy

Published:1998-06 Issue:2 Volume:63 Page:411-420
ISSN:0022-4812
Container-title:The Journal of Symbolic Logic
language:en
Short-container-title:J. symb. log.

Author:

Arslanov Marat M.,Laforte Geoffrey L.,Slaman Theodore A.

Abstract

AbstractWe show that the intersection of the class of 2-REA degrees with that of the ω-r.e. degrees consists precisely of the class of d.r.e. degrees. We also include some applications and show that there is no natural generalization of this result to higher levels of the REA hierarchy.

Publisher

Cambridge University Press (CUP)

Subject

Logic,Philosophy

Reference14 articles.

1. Lower Bounds for Pairs of Recursively Enumerable Degrees

2. On isolating r.e. and isolated d-r.e. degrees

3. LaForte, G. , Phenomena in the n-r.e. and n-REA degrees, Ph.D. thesis , University of Michigan, Ann Arbor, 1995.

4. Recursively Enumerable Sets and Degrees

Cited by 21 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Degrees of Selector Functions and Relative Computable Categoricity;Lobachevskii Journal of Mathematics;2024-04

2. Degrees of selector functions and relative computable categoricity;Mathematics and Theoretical Computer Science;2024-01-02

3. Marat Mirzaevich Arslanov (on his eightieth birthday);Russian Mathematical Surveys;2024

4. Марат Мирзаевич Арсланов (к восьмидесятилетию со дня рождения);Успехи математических наук;2024

5. Normalizing notations in the Ershov hierarchy;Mathematical Logic Quarterly;2021-11