✦ LIBER ✦

Some proofs of data refinement

✍ Scribed by Earlin Lutz

Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 435 KB
Volume: 34
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(90)90157-s

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

NEW PROOFS OF SOME INTUITIONISTIC PRINCI

NEW PROOFS OF SOME INTUITIONISTIC PRINCIPLES

✍ J. Lambek; P. J. Scott 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 620 KB

Probabilistic Proofs of Some Real Invers

Probabilistic Proofs of Some Real Inversion Formulas

✍ Jozef L. Teugels 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 287 KB

## Abstract We provide short probabilistic proofs for a number of new and known real inversion formulas for the Laplace and for the Stieltjes transform.

Completeness Proofs for Some Logics of P

Completeness Proofs for Some Logics of Programs

✍ Bogdan S. Chlebus 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 712 KB

Bijective proofs of some classical parti

Bijective proofs of some classical partition identities

✍ Jeffrey B Remmel 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 797 KB

Proof of safety: Some interpretations

✍ Lehman, A.J. 📂 Article 📅 1951 🏛 Elsevier ⚖ 326 KB

Combinatorial proofs of some limit formu

Combinatorial proofs of some limit formulas involving orthogonal polynomials

✍ J. Labelle; Y.N. Yeh 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 919 KB

The object of this paper is to prove combinatorially several (13 of them) limit formulas relating different families of hypergeometric orthogonal polynomials in Askey's chart classifying them. We first find a combinatorial model for Hahn polynomials which, as pointed out by Foata at the ICM (1983),