✦ LIBER ✦

On Recursive Enumeration Without Repetition

✍ Scribed by A. H. Lachlan

Publisher: John Wiley and Sons
Year: 1965
Tongue: English
Weight: 709 KB
Volume: 11
Category: Article
ISSN: 0044-3050
DOI: 10.1002/malq.19650110305

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On Recursive Enumeration Without Repetit

On Recursive Enumeration Without Repetition: A Correction

✍ A. H. Lachlan 📂 Article 📅 1967 🏛 John Wiley and Sons 🌐 English ⚖ 118 KB

A STRUCTURAL CRITERION FOR RECURSIVE ENU

A STRUCTURAL CRITERION FOR RECURSIVE ENUMERATION WITHOUT REPETITION

✍ Marian Boykan Pour-El; William A. Howard 📂 Article 📅 1964 🏛 John Wiley and Sons 🌐 English ⚖ 573 KB

Two theorems on recursively enumerable s

Two theorems on recursively enumerable sets

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

On characterizations of recursively enum

On characterizations of recursively enumerable languages

✍ Michel Latteux; Paavo Turakainen 📂 Article 📅 1990 🏛 Springer-Verlag 🌐 English ⚖ 402 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