On the complexity of axiomatizations of
✍
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,