✦ LIBER ✦

Extended versions of Deny's theorem via de Finetti's theorem

✍ Scribed by D.N. Shanbhag

Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 842 KB
Volume: 12
Category: Article
ISSN: 0167-9473
DOI: 10.1016/0167-9473(91)90107-d

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Generalized versions of Hall's theorem

✍ D.J.A. Welsh 📂 Article 📅 1971 🏛 Elsevier Science 🌐 English ⚖ 260 KB

Weak versions of Ramsey's theorem

✍ Richard Rado 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 359 KB

Strong versions of Sperner's theorem

✍ Curtis Greene; Daniel J Kleitman 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 515 KB

An elementary proof for an extended vers

An elementary proof for an extended version of the Choquet-Deny theorem

✍ C.Radhakrishna Rao; D.N Shanbhag 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 374 KB

Polynomial-time versions of Sylow's theo

Polynomial-time versions of Sylow's theorem

✍ W.M Kantor; D.E Taylor 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 960 KB

Some subrecursive versions of Grzegorczy

Some subrecursive versions of Grzegorczyk's Uniformity Theorem

✍ Dimiter Skordev 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 92 KB

## Abstract A theorem published by A. Grzegorczyk in 1955 states a certain kind of effective uniform continuity of computable functionals whose values are natural numbers and whose arguments range over the total functions in the set of the natural numbers and over the natural numbers. Namely, for a