๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

An Interval of Computably Enumerable Isolating Degrees

โœ Scribed by Matthew C. Salts

Publisher
John Wiley and Sons
Year
1999
Tongue
English
Weight
850 KB
Volume
45
Category
Article
ISSN
0044-3050

No coin nor oath required. For personal study only.

โœฆ Synopsis

Abstract

We construct computably enumerable degrees a < b such that all computably enumerable degrees c with a < c < b isolate some d. c. e. degree d.

๐Ÿ“œ SIMILAR VOLUMES

Undecidability and 1-types in intervals
Undecidability and 1-types in intervals of the computably enumerable degrees
โœ Klaus Ambos-Spies; Denis R. Hirschfeldt; Richard A. Shore ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 338 KB

We show that the theory of the partial ordering of the computably enumerable degrees in any given nontrivial interval is undecidable and has uncountably many 1-types.

Orbits of computably enumerable sets: lo
Orbits of computably enumerable sets: low sets can avoid an upper cone
โœ Russell Miller ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 222 KB

We investigate the orbit of a low computably enumerable (c.e.) set under automorphisms of the partial order E of c.e. sets under inclusion. Given an arbitrary low c.e. set A and an arbitrary noncomputable c.e. set C, we use the New Extension Theorem of Soare to construct an automorphism of E mapping