ON EXTENSIONS OF EMBEDDINGS INTO THE ENUMERATION DEGREES OF THE ${\Sigma

ON EXTENSIONS OF EMBEDDINGS INTO THE ENUMERATION DEGREES OF THE ${\Sigma_2^0}$-SETS

Published:2005-12 Issue:02 Volume:05 Page:247-298
ISSN:0219-0613
Container-title:Journal of Mathematical Logic
language:en
Short-container-title:J. Math. Log.

Author:

LEMPP STEFFEN¹,SLAMAN THEODORE A.²,SORBI ANDREA³

Affiliation:

1. Department of Mathematics, University of Wisconsin, Madison, WI 53706-1388, USA

2. Department of Mathematics, University of California, Berkeley, CA 94720-3840, USA

3. Dipartimento di Scienze Matematiche e Informatiche "Roberto Magari", Università di Siena, I-53100 Siena, Italy

Abstract

We give an algorithm for deciding whether an embedding of a finite partial order [Formula: see text] into the enumeration degrees of the [Formula: see text]-sets can always be extended to an embedding of a finite partial order [Formula: see text].

Publisher

World Scientific Pub Co Pte Lt

Subject

Logic

Link

https://www.worldscientific.com/doi/pdf/10.1142/S0219061305000432

Reference17 articles.

1. Some Special Pairs of Σ2 e-Degrees

2. Generic copies of countable structures

3. Partial degrees and the density problem. Part 2: The enumeration degrees of the Σ2 sets are dense

4. The d.r.e. degrees are not dense

5. Notes on the O‴ priority method with special attention to density results

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

1. Extensions of two constructions of Ahmad;Computability;2022-12-21

2. ON CUPPING AND AHMAD PAIRS;The Journal of Symbolic Logic;2022-12-11

3. Fragments of the theory of the enumeration degrees;Advances in Mathematics;2021-06

4. S. Barry Cooper (1943–2015);Computability;2018-06-07

5. Enumeration Reducibility and Computable Structure Theory;Computability and Complexity;2016-12-01