✦ LIBER ✦

Mengoli on “Quasi Proportions”

✍ Scribed by Ma.Rosa Massa

Publisher: Elsevier Science
Year: 1997
Tongue: English
Weight: 274 KB
Volume: 24
Category: Article
ISSN: 0315-0860
DOI: 10.1006/hmat.1996.2147

No coin nor oath required. For personal study only.

✦ Synopsis

This paper aims to analyze the first three elementa of the Geometriae speciosae elementa (Bologna, 1659) of Pietro Mengoli (1625-1686), probably the most original pupil of Bonaventura Cavalieri (1598-1647). In this work, Mengoli develops a new method for the calculation of quadratures using a numerical theory called ''quasi proportions.'' He grounds quasi proportions in the theory of proportions as presented in the fifth book of Euclid's Elements, to which he adds some original ideas: the ratio ''quasi zero,'' the ratio ''quasi infinite,'' and the ratio ''quasi a number.'' A detailed analysis of this theory demonstrates the originality of Pietro Mengoli's work as regards both its content and his method of exposition.

📜 SIMILAR VOLUMES

Quasi-stetiger Proportional-Regler für h

Quasi-stetiger Proportional-Regler für höhere Temperaturen

✍ Priv. Doz.-Ing. F. E. Wittig; Dr. W. Schilling 📂 Article 📅 1961 🏛 John Wiley and Sons 🌐 German ⚖ 366 KB

On Quasi-Harada Rings

✍ Yoshitomo Baba; Kenichi Iwase 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 299 KB

the following two conditions: Ž . \* Every non-small left R-module contains a non-zero injective submodule. Ž . \* \* Every non-cosmall right R-module contains a non-zero projective direct summand. Ž . K. Oshiro Hokkaido Math. J. 13, 1984, 310᎐338 further studied the above Ž . Ž conditions, and call

On quasi-isometric mappings, II

✍ Fritz John 📂 Article 📅 1969 🏛 John Wiley and Sons 🌐 English ⚖ 389 KB

On a Quasi-Ramsey problem

✍ Paul Erdös; János Pach 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 368 KB

It is proved th2t if a graph G has at least cn log n vertices, then either G or its complement G contains a subgraph H with a t least n vertices and minimum degree a t least 1 V ( H ) I /2. This result is not far from being best possible, as is shown by a rather unusual random construction. Some rel

On Quasi-thin Association Schemes

✍ Mitsugu Hirasaka; Mikhail Muzychuk 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 144 KB

An association scheme (or simply, a scheme) is called thin if each of its basic relations has valency 1. It is easy to see that thin schemes can be viewed as groups and, conversely, groups can be seen as thin schemes. In the present paper, we investigate schemes the basic relations of which have val

On Quasi-Universal Model Classes

✍ Manfred Armbrust; Klaus Kaiser 📂 Article 📅 1972 🏛 John Wiley and Sons 🌐 English ⚖ 288 KB