✦ LIBER ✦

Axiomatizability and completeness of some classes of s-polygons

✍ Scribed by A. A. Stepanova

Publisher: Springer US
Year: 1991
Tongue: English
Weight: 632 KB
Volume: 30
Category: Article
ISSN: 0002-5232
DOI: 10.1007/bf01980252

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Axiomatizability and model completeness

Axiomatizability and model completeness of the class of regular polygons

✍ A. A. Stepanova 📂 Article 📅 1994 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 672 KB

Complete classes of regular polygons wit

Complete classes of regular polygons with finitely many idempotents

✍ E. V. Ovchinnikova 📂 Article 📅 1995 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 252 KB

A P-Completeness Result for Visibility G

A P-Completeness Result for Visibility Graphs of Simple Polygons

✍ Jana Dietel; Hans-Dietrich Hecker 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 187 KB

Multiple completeness of eigen and assoc

Multiple completeness of eigen and associated vectors of some classes of operator-functions analytic in a disk

✍ G. V. Radzievskii 📂 Article 📅 1973 🏛 Springer US 🌐 English ⚖ 153 KB

MILNOR Number of Complete Intersections

MILNOR Number of Complete Intersections and NEWTON Polygons

✍ Bernd Martin; Gerhard Pfister 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 744 KB

The main result of this 1)aper will he a formula to compute the Milnor number of an isolated complete intersection singulaFity using the Newton polygon. We were inspired by the articles of KOUCHNIRENKO [4], who gave such a formula for hyl)ersurfaces, anti GREUEL and HAMM [2], who proved a similar re

Classes of chromatically equivalent grap

Classes of chromatically equivalent graphs and polygon trees

✍ Shaoji Xu 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 747 KB