✦ LIBER ✦

Sublattices of the Recursively Enumerable Degrees

✍ Scribed by S. K. Thomason

Publisher: John Wiley and Sons
Year: 1971
Tongue: English
Weight: 471 KB
Volume: 17
Category: Article
ISSN: 0044-3050
DOI: 10.1002/malq.19710170131

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Strong Minimal Covers for Recursively En

Strong Minimal Covers for Recursively Enumerable Degrees

✍ S. Barry Cooper 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 386 KB

## Abstract We prove that there exists a nonzero recursively enumerable Turing degree possessing a strong minimal cover. Mathematics Subject Classification: 03D30.

Not every finite lattice is embeddable i

Not every finite lattice is embeddable in the recursively enumerable degrees

✍ A.H Lachlan; R.I Soare 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 469 KB

## A certain lattice with eight elements is shown to be not embeddable as a lattice in the recursively enumerable degrees. This refutes the well-known Embedding Conjecture which asserted that every finite lattice could be so embedded.

Recursively enumerable sets and degrees:

Recursively enumerable sets and degrees: R. I. Soare, Springer, 1987, 437 pp

✍ Gian-Carlo Rota 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 64 KB

The first comprehensive account of the theory of recursive functions since Hartley Rogers's classic treatise. The author wisely keeps an eye to computer application, aware of the fact that mathematical logic is rapidly becoming one of the most active branches of applied mathematics. The reading may

On a Class of Recursively Enumerable Set

On a Class of Recursively Enumerable Sets

✍ Farzad Didehvar 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 225 KB 👁 1 views

## Abstract We define a class of so‐called ∑(__n__)‐sets as a natural closure of recursively enumerable sets __W__~n~ under the relation “∈” and study its properties.

The Index Set of Injectively Enumerable

The Index Set of Injectively Enumerable Classes of Recursively Enumerable Sets in ∑5-Complete

✍ Stephan Wehner 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 372 KB

## Abstract I introduce an effective enumeration of all effective enumerations of classes of r. e. sets and define with this the index set __IE__ of injectively enumerable classes. It is easy to see that this set is ∑~5~ in the Arithmetical Hierarchy and I describe a proof for the ∑~5~‐hardness of

Jumps of nontrivial splittings of recurs

Jumps of nontrivial splittings of recursively enumerable sets

✍ Michael A. Ingrassia; Steffen Lempp 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 375 KB