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

The degrees of computably enumerable sets are not dense

โœ Scribed by George Barmpalias; Andrew E.M. Lewis

Book ID
118415640
Publisher
Elsevier Science
Year
2006
Tongue
English
Weight
251 KB
Volume
141
Category
Article
ISSN
0168-0072

No coin nor oath required. For personal study only.

๐Ÿ“œ 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.

Sets of generators and automorphism base
Sets of generators and automorphism bases for the enumeration degrees
โœ Andrea Sorbi ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 568 KB

We exhibit some automorphism bases for the enumeration degrees, and we derive some consequences relative to the automorphisms of the enumeration degrees.