✦ LIBER ✦

The number of nonequivalent computable indexations for a fixed family of sets

✍ Scribed by S. L. Bereznyuk

Publisher: Springer US
Year: 1993
Tongue: English
Weight: 399 KB
Volume: 32
Category: Article
ISSN: 0002-5232
DOI: 10.1007/bf02260928

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the number of relations in the cohomo

On the number of relations in the cohomology of a fixed point set

✍ Theodore Chang 📂 Article 📅 1976 🏛 Springer 🌐 English ⚖ 408 KB

Antipodal and Fixed Point Theorems for S

Antipodal and Fixed Point Theorems for Sets in RnBounded by a Finite Number of Spheres

✍ Ky Fan 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 68 KB

Computability of Real Numbers by Using a

Computability of Real Numbers by Using a Given Class of Functions in the Set of the Natural Numbers

✍ Dimiter Skordev 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 226 KB 👁 2 views

Conditions of effective infinity for the

Conditions of effective infinity for the set of computable indexings of a class of constructive models

✍ V. P. Dobritsa 📂 Article 📅 1994 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 227 KB

The Law of Large Numbers for Product Par

The Law of Large Numbers for Product Partial Sum Processes Indexed by Sets

✍ J.S. Kwon 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 345 KB

The number of limit cycles for a family

The number of limit cycles for a family of polynomial systems

✍ Guanghui Xiang; Maoan Han; Tonghua Zhang 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 441 KB

In thin paper~ the number of hmlt cycles m a family of polynomial systems was studmd by the bifurcation methods With the help of a computer algebra system (e.g., MAPLE 7 0), we obtain that the least upper bound for the number of hmlt cycles appearing m a global bifurcation of systems (2.1) and ( 2.2