Abstract
Comparison is suggested between the computability potential scales of algebras of different cardinalities and prove the undecidability of the elementary theory of the computability potential scale of all finite algebras.
Similar content being viewed by others
References
Pinus A. G. and Zhurkov S. V., “On computability potential scales of universal algebras,” Vychisl. Sistemy, 169, 26–38 (2002).
Pinus A. G., Conditional Terms and Their Applications to Algebra and the Theory of Computations [in Russian], Izdat. NGTU, Novosibirsk (2002).
Pinus A. G., “Conditional terms and their applications to algebra and the theory of computations, ” Uspekhi Mat. Nauk, 56, No. 4, 35–72 (2001).
Pinus A. G. and Zhurkov S. V., “Computability potential scales of finite algebras: results and problems,” Fundam. Prikl. Mat., 9, No. 3, 145–164 (2003).
Pinus A. G., “Calculus of conditional identities and conditionally rational equivalence,” Algebra i Logika, 37, No. 4, 432–459 (1998).
Pinus A. G. and Zhurkov S. V., “Some remarks on computability potential scales for n-element algebras,” in: Algebra and Model Theory 3 [in Russian], NGTU, Novosibirsk, 2001, pp. 107–113.
Pinus A. G., “On conditionally rationally equivalent algebras,” Vychisl. Sistemy, 165, 1–29 (1999).
Author information
Authors and Affiliations
Additional information
Original Russian Text Copyright © 2007 Pinus A. G.
__________
Translated from Sibirskiĭ Matematicheskiĭ Zhurnal, Vol. 48, No. 3, pp. 668–673, May–June, 2007.
Rights and permissions
About this article
Cite this article
Pinus, A.G. The computability potential scale of all finite algebras. Sib Math J 48, 539–543 (2007). https://doi.org/10.1007/s11202-007-0055-8
Received:
Issue Date:
DOI: https://doi.org/10.1007/s11202-007-0055-8