✦ LIBER ✦

Precompletely enumerated sets

✍ Scribed by S. G. Dvornikov

Book ID: 105020040
Publisher: SP MAIK Nauka/Interperiodica
Year: 1980
Tongue: English
Weight: 321 KB
Volume: 20
Category: Article
ISSN: 0037-4466
DOI: 10.1007/bf00970393

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Uniformly Precomplete Enumerations

✍ M. Adrian Carpentier 📂 Article 📅 1970 🏛 John Wiley and Sons 🌐 English ⚖ 314 KB

Application of precomplete enumerations

Application of precomplete enumerations to tabular-type degrees and index sets

✍ V. L. Selivanov 📂 Article 📅 1989 🏛 Springer US 🌐 English ⚖ 483 KB

A category of enumerated sets

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

ω-operations over partial enumerated set

ω-operations over partial enumerated sets

✍ Andrzej Orlicki 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 445 KB

## Abstract In the present paper we concentrate on fundamental problems concerning ω‐operations over partial enumerated sets. The notion of “HOM‐lifts” seems to be an adequate tool for this kind of investigations. MSC: 03D45, 18A30.

Binary Relations Over the Category of En

Binary Relations Over the Category of Enumerated Sets

✍ A. Orlicki 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 747 KB

Covariant Hom-Functors on the Category o

Covariant Hom-Functors on the Category of Enumerated Sets

✍ Andrzej Orlicki 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 918 KB

Let NSET be the category of enumerated sets. I n the ER&OV book [l] a lot has been said about the following problems related to this category. Let S, , S, be two enumerated sets. What assumptions about these sets should we accept in order to find "good" (i.e. principal computable) enumeration of the