## 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,
Completeness of the infinitary polyadic axiomatization
β Scribed by Isidore Fleischer
- Publisher
- John Wiley and Sons
- Year
- 1993
- Tongue
- English
- Weight
- 271 KB
- Volume
- 39
- Category
- Article
- ISSN
- 0044-3050
No coin nor oath required. For personal study only.
β¦ Synopsis
Abstract
The present note is a reworking and streamlining of Daigneault and Monk's Representation Theory for Polyadic Algebras. MSC: 03G15.
π SIMILAR VOLUMES
## Abstract We consider the following generalization of the notion of a structure recursive relative to a set __X.__ A relational structure __A__ is said to be a Ξ(__X__)βstructure if for each relation symbol __R__, the interpretation of __R__ in __A__ is β relative to __X__, where Ξ² = Ξ(__R__). We
## Abstract In previous works, we presented a modification of the usual possible world semantics by introducing an independent temporal structure in each world and using accessibility functions to represent the relation among them. Different properties ofthe accessibility functions (being injective
THE COMPLETENESS O F LuI, (P) by PHILIP W. GRANT in Swansea, Wales (Great Britain
## Abstract We show that for infinite ordinals __Ξ±__ the class of polyadic algebras of dimension __Ξ±__ has the super amalgamation property (Β© 2010 WILEYβVCH Verlag GmbH & Co. KGaA, Weinheim)