✦ LIBER ✦

Recursive-combinatorial properties of subsets of the natural numbers

✍ Scribed by A. N. Degtev

Publisher: Springer US
Year: 1990
Tongue: English
Weight: 420 KB
Volume: 29
Category: Article
ISSN: 0002-5232
DOI: 10.1007/bf01979935

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Weak combinatorial selective properties

Weak combinatorial selective properties of subsets of the natural numbers

✍ A. N. Degtev 📂 Article 📅 1990 🏛 Springer US 🌐 English ⚖ 437 KB

General recursive functions of natural n

General recursive functions of natural numbers

✍ S. C. Kleene 📂 Article 📅 1936 🏛 Springer 🌐 English ⚖ 768 KB

Representations of the real numbers and

Representations of the real numbers and of the open subsets of the set of real numbers

✍ Klaus Weihrauch; Christoph Kreitz 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 859 KB

On the maximum number of balancing subse

On the maximum number of balancing subsets

✍ Seiji Nabeya 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 156 KB

The number of linear extensions of subse

The number of linear extensions of subset ordering

✍ Jichang Sha; D.J. Kleitman 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 520 KB

We find asymptotic upper and lower bounds on the number of linear extensions of the containment ordering of subsets of a finite set. These agree in their most significant non-trivial terms. A related open question is described. L > 2"((n + 1)log 2 -4 log 2m -5 + o(1 ln)).

On the finiteness of the recursive chrom

On the finiteness of the recursive chromatic number

✍ William I. Gasarch; Andrew C.Y. Lee 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 559 KB

A recursive graph is a graph whose vertex and edge sets are recursive. A highly recursive graph is a recursive graph that also has the following property: one can recursively determine the neighbors of a vertex. Both of these have been studied in the literature. We consider an intermediary notion: