✦ LIBER ✦

Two theorems on many-one degrees of recursively enumerable sets

✍ Scribed by A. H. Lachlan

Publisher: Springer US
Year: 1972
Tongue: English
Weight: 513 KB
Volume: 11
Category: Article
ISSN: 0002-5232
DOI: 10.1007/bf02219743

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Two theorems on recursively enumerable s

Two theorems on recursively enumerable sets

✍ M. M. Arslanov 📂 Article 📅 1968 🏛 Springer US 🌐 English ⚖ 174 KB

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.

On discrete families of recursively enum

On discrete families of recursively enumerable sets

✍ V. V. V'yugin 📂 Article 📅 1972 🏛 Springer US 🌐 English ⚖ 789 KB

On sQ-completeness of recursively enumer

On sQ-completeness of recursively enumerable sets

✍ R. Sh. Omanadze 📂 Article 📅 1992 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 232 KB

Low sets without subsets of higher many-

Low sets without subsets of higher many-one degree

✍ Patrizio Cintioli 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 112 KB

A new proof of the theorem on exponentia

A new proof of the theorem on exponential diophantine representation of enumerable sets

✍ Yu. V. Matiyasevich 📂 Article 📅 1980 🏛 Springer US 🌐 English ⚖ 681 KB