Abstract
Following research initiated by Tarski, Craig and Németi, and futher pursued by Sain and others, we show that for certain subsets G of ω ω, atomic countable G polyadic algebras are completely representable. G polyadic algebras are obtained by restricting the similarity type and axiomatization of ω-dimensional polyadic algebras to finite quantifiers and substitutions in G. This contrasts the cases of cylindric and relation algebras.
Similar content being viewed by others
References
Henkin, L., J. Monk, and A. Tarski, Cylindric Algebras. Part 1 and 2. North Holland, 1971, 1985.
Hircsh R., Hodkinson I. (1997) ‘Complete representations in algebraic logic’. Journal of Symbolic Logic 62(3): 816–847
Hodges, W., Model Theory, volume 42 of Encyclopedia of mathematics and its applications, Cambridge University Press, 1993.
Németi, I., ‘Algebraisation of quantifier logics, an introductory overview’, Math. Inst. Budapest, Preprint, No 13-1996. A shortened version appeared in Studia Logica vol. 50, 4 (1991), 465–569.
Sain, I., ‘Searching for a finitizable algebraization of first order logic’, 8, Logic Journal of IGPL, Oxford University Press, no 4 (2000), 495–589.
Sagi, G., On the Finitization problem in Algebraic logic PhD dissertation, 1999.
Sayed Ahmed T. (2004) ‘On amalgamation of reducts of polyadic algebras’. Algebra Universalis 51: 301–359
Sayed Ahmed T. (2005) ‘Algebraic Logic, where does it stand today?’. Bulletin of Symbolic Logic 11(4): 465–516
Sayed Ahmed, T., ‘The class of completely representable quasi-polyadic algebras of dimension > 2 is not elementary’. Submitted.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Sayed Ahmed, T. On Complete Representations of Reducts of Polyadic Algebras. Stud Logica 89, 325–332 (2008). https://doi.org/10.1007/s11225-008-9131-8
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11225-008-9131-8