𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A semilattice generated by superlow computably enumerable degrees

✍ Scribed by M. Kh. Faizrakhmanov

Book ID
111503536
Publisher
Allerton Press, Inc.
Year
2011
Tongue
English
Weight
507 KB
Volume
55
Category
Article
ISSN
1066-369X

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.

A necessary and sufficient condition for
A necessary and sufficient condition for embedding principally decomposable finite lattices into the computably enumerable degrees
✍ M. Lerman πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 176 KB

We present a necessary and su cient condition for the embeddability of a principally decomposable ΓΏnite lattice into the computably enumerable degrees. This improves a previous result which required that, in addition, the lattice be ranked. The same condition is also necessary and su cient for a ΓΏni