Abstract
We find the length of scales of computability potentials for n-element algebras. As a consequence, we find the length of the filter generated by the clone of a discriminant function in the lattice of clones of functions on an n-element set.
Similar content being viewed by others
References
Pinus A. G. and Zhurkov S. V., “On potential scales of computability of universal algebras,” Vychisl. Sistemy (2002) (to appear).
Pinus A. G., “On conditionally rationally equivalent algebras,” in: Structural and Complex Problems of Computability (Vychisl. Sistemy, 165) [in Russian], Inst. Mat. (Novosibirsk), Novosibirsk, 1999, pp. 1–29.
Pinus A. G., “On conditional terms and identities on universal algebras,” in: Structural Algorithmic Properties of Computability (Vychisl. Sistemy, 156) [in Russian], Inst. Mat. (Novosibirsk), Novosibirsk, 1996, pp. 59–78.
Pinus A. G., “Conditional terms and their applications,” in: Algebra: Proc. of Kurosh Conference, Walter de Gruyter, Berlin and New York, 2000, pp. 291–300.
Pinus A. G., “Program-computable functions on universal algebras,” Uspekhi Mat. Nauk, 56, No. 4, 35–72 (2001).
Pinus A. G., “Calculus of conditional identities and conditionally rational equivalence,” Algebra i Logika, 37, No. 4, 381–408 (1998).
Cameron P., Solomon R., and Turull A., “Chains of subgroups in symmetric groups,” J. Algebra, 127, No. 2, 340–352 (1989).
Pinus A. G., “N-conditional terms and n-conditionally rational equivalence,” Izv. Vyssh. Uchebn. Zaved. Mat., No. 1, 36–40 (1999).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Pinus, A.G., Zhurkov, S.V. On the Length of Scales of Computability Potentials for n-Element Algebras. Siberian Mathematical Journal 43, 689–693 (2002). https://doi.org/10.1023/A:1016328403777
Issue Date:
DOI: https://doi.org/10.1023/A:1016328403777