✦ LIBER ✦

Recursive versus recursively enumerable binary relations

✍ Scribed by Dev K. Roy

Publisher: Springer Netherlands
Year: 1993
Tongue: English
Weight: 386 KB
Volume: 52
Category: Article
ISSN: 0039-3215
DOI: 10.1007/bf01053261

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Complete, Recursively Enumerable Relatio

Complete, Recursively Enumerable Relations in Arithmetic

✍ Giovanna D'Agostino; Mario Magnago 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 489 KB

## Abstract Using only propositional connectives and the provability predicate of a Σ~1~‐sound theory __T__ containing Peano Arithmetic we define recursively enumerable relations that are complete for specific natural classes of relations, as the class of all r. e. relations, and the class of all s

Recursively Enumerable L-Sets

✍ Loredana Biacino; Giangiacomo Gerla 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 405 KB

Recursively enumerable bw-degrees

✍ G. N. Kobzev 📂 Article 📅 1977 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 409 KB

On Some Properties of Recursively Enumer

On Some Properties of Recursively Enumerable Equivalence Relations

✍ Stefano Baratella 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 470 KB

Intrinsically recursively enumerable sub

Intrinsically recursively enumerable subalgebras of a recursive Boolean algebra

✍ S. P. Odintsov 📂 Article 📅 1992 🏛 Springer US 🌐 English ⚖ 425 KB

Strong enumeration properties of recursi

Strong enumeration properties of recursively enumerable classes

✍ J. B. Florence 📂 Article 📅 1969 🏛 John Wiley and Sons 🌐 English ⚖ 654 KB