✦ LIBER ✦

On cardinality of semilattices of enumerations of nondiscrete families

✍ Scribed by S. A. Badaev

Publisher: SP MAIK Nauka/Interperiodica
Year: 1993
Tongue: English
Weight: 581 KB
Volume: 34
Category: Article
ISSN: 0037-4466
DOI: 10.1007/bf00971395

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the cardinality of the upper semilatt

On the cardinality of the upper semilattice of computable enumerations

✍ A. B. Khutoretskii 📂 Article 📅 1971 🏛 Springer US 🌐 English ⚖ 461 KB

On some examples of upper semilattices o

On some examples of upper semilattices of computable enumerations

✍ V. V. V'yugin 📂 Article 📅 1973 🏛 Springer US 🌐 English ⚖ 698 KB

The semilattice of computable families o

The semilattice of computable families of recursively enumerable sets

✍ A. N. Degtev 📂 Article 📅 1991 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 228 KB

Cardinality questions concerning semilat

Cardinality questions concerning semilattices of finite breadth

✍ S.Z Ditor 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 570 KB

It is shown that if L is a lattice in which every element has only finitely many predecessors and (\*) every element has no more than k immediate predecessors, for some positive integer k, then ILl~k-r An example is constructed in which k =2 and ILl=~t, but the question of whether ILl =~k-~ is possi

Enumerations of families of general recu

Enumerations of families of general recursive functions

✍ V. L. Selivanov 📂 Article 📅 1976 🏛 Springer US 🌐 English ⚖ 858 KB

Upper semilattice of recursively enumera

Upper semilattice of recursively enumerable sQ-degrees

✍ R. Sh. Omanadze 📂 Article 📅 1991 🏛 Springer US 🌐 English ⚖ 518 KB