✦ LIBER ✦

Some theorems on structural consequence operations

✍ Scribed by Stephen L. Bloom

Publisher: Springer Netherlands
Year: 1975
Tongue: English
Weight: 412 KB
Volume: 34
Category: Article
ISSN: 0039-3215
DOI: 10.1007/bf02314419

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On finitely based consequence operations

✍ Andrzej Wroński 📂 Article 📅 1976 🏛 Springer Netherlands 🌐 English ⚖ 312 KB

Some theorems on structural entailment r

Some theorems on structural entailment relations

✍ Janusz Czelakowski 📂 Article 📅 1983 🏛 Springer Netherlands 🌐 English ⚖ 892 KB

Some theorems on Gabor operators

✍ Graaf, J. 📂 Article 📅 1981 🏛 Springer 🌐 English ⚖ 326 KB

The object of this study is the class of closable Gabor operators. That is the set of operators which map a Gabor function (or 'note') into a multiple of a Gabor function. By using the Bargman space (sometimes called Bargman representation) some general properties of these operators are derived. It

Some structural theorems for partial dif

Some structural theorems for partial difference operators

✍ J. S. Maybee 📂 Article 📅 1965 🏛 Springer-Verlag 🌐 English ⚖ 436 KB

On a limit theorem for some modified ope

On a limit theorem for some modified operators

✍ Xiaojing Xiang 📂 Article 📅 1995 🏛 Akadmiai Kiad 🌐 English ⚖ 313 KB

A theorem on random polynomials and some

A theorem on random polynomials and some consequences in average complexity

✍ F. Cucker; M.-F. Roy 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 324 KB

Real polynomials have very often very few real roots, and when algorithms depend on the number of real roots of polynomials rather than on their degrees, this fact has consequences on average complexity of algorithms. In this paper we recall some classical results on the average number of real root