✦ LIBER ✦

Arithmetical representations of enumerable sets with a small number of quantifiers

✍ Scribed by Yu. V. Matiyasevich

Publisher: Springer US
Year: 1976
Tongue: English
Weight: 262 KB
Volume: 6
Category: Article
ISSN: 1573-8795
DOI: 10.1007/bf01084081

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Arithmetic characterization of algebraic

Arithmetic characterization of algebraic number fields with small class numbers

✍ Alfred Czogala 📂 Article 📅 1981 🏛 Springer-Verlag 🌐 French ⚖ 411 KB

A parametric representation of fuzzy num

A parametric representation of fuzzy numbers and their arithmetic operators

✍ Ronald E. Giachetti; Robert E. Young 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 972 KB

A normal form for arithmetical represent

A normal form for arithmetical representation of N P-sets

✍ Bernard R. Hodgson; Clement F. Kent 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 582 KB

The Number of Independent Sets in a Grap

The Number of Independent Sets in a Graph with Small Maximum Degree

✍ David Galvin; Yufei Zhao 📂 Article 📅 2010 🏛 Springer Japan 🌐 English ⚖ 180 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

The Enumeration of Permutations with a P

The Enumeration of Permutations with a Prescribed Number of “Forbidden” Patterns

✍ John Noonan; Doron Zeilberger 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 219 KB

We initiate a general approach for the fast enumeration of permutations with a prescribed number of occurrences of ''forbidden'' patterns that seems to indicate that the enumerating sequence is always P-recursive. We illustrate the method completely in terms of the patterns ''abc, '' ''cab,'' and ''