𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Axiomatizing complex algebras by games

✍ Scribed by Ian Hodkinson; Szabolcs Mikulás; Yde Venema

Publisher
Springer
Year
2001
Tongue
English
Weight
196 KB
Volume
46
Category
Article
ISSN
0002-5240

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the complexity of axiomatizations of
On the complexity of axiomatizations of the class of representable quasi-polyadic equality algebras
✍ Tarek Sayed Ahmed 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 157 KB

## MSC (2010) Primary: 03G15 Using games, as introduced by Hirsch and Hodkinson in algebraic logic, we give a recursive axiomatization of the class RQPEA α of representable quasi-polyadic equality algebras of any dimension α. Following Sain and Thompson in modifying Andréka's methods of splitting,

Algebraic computation of the number of z
Algebraic computation of the number of zeros of a complex polynomial in the open unit disk by a polynomial representation
✍ B. Gleyse; A. Larabi; M. Moflih 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 224 KB

We present a general method for the exact computation of the number of zeros of a complex polynomial inside the unit disk, assuming that the polynomial does not vanish on the unit circle. We prove the existence of a polynomial sequence. This sequence involves a reduced number of arithmetic operation