𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Complexity of some natural problems on the class of computableI-algebras

✍ Scribed by N. T. Kogabaev

Publisher
SP MAIK Nauka/Interperiodica
Year
2006
Tongue
English
Weight
171 KB
Volume
47
Category
Article
ISSN
0037-4466

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The Computational Complexity of Some Pro
The Computational Complexity of Some Problems of Linear Algebra
✍ Jonathan F Buss; Gudmund S Frandsen; Jeffrey O Shallit πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 330 KB

We consider the computational complexity of some problems dealing with matrix rank. Let E, S be subsets of a commutative ring R. Let x 1 , x 2 , ..., x t be variables. Given a matrix M=M(x 1 , x 2 , ..., x t ) with entries chosen from E \_ [x 1 , x 2 , ..., x t ], we want to determine maxrank S (M)=

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,