✦ LIBER ✦

Arithmetical Problems and Recursively Enumerable Predicates

✍ Scribed by Martin Davis

Book ID: 111654504
Publisher: Association for Symbolic Logic
Year: 1953
Tongue: English
Weight: 815 KB
Volume: 18
Category: Article
ISSN: 0022-4812
DOI: 10.2307/2266325

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Elimination of quantifiers from arithmet

Elimination of quantifiers from arithmetical formulas defining recursively enumerable sets

✍ Yuri Matiyasevich 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 97 KB

Classes of Recursively Enumerable Sets a

Classes of Recursively Enumerable Sets and Their Decision Problems

✍ H. G. Rice 📂 Article 📅 1953 🏛 American Mathematical Society 🌐 English ⚖ 698 KB

Recursively Enumerable L-Sets

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

Recursively Enumerable Images of Arithme

Recursively Enumerable Images of Arithmetic Sets

✍ Richard Rosenberg 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 656 KB

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

Anti-Mitotic Recursively Enumerable Sets

✍ Klaus Ambos-Spies 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 994 KB