Conditional terms and their applications in algebra and computation theory
Trudy Matematicheskogo Instituta imeni V.A. Steklova, Tome 56 (2001) no. 4, pp. 649-686
Voir la notice de l'article provenant de la source Math-Net.Ru
The notion of program-computable function on a universal
algebra is formalized through the notion of conditional term.
This leads to a somewhat new approach to the study of traditional
algebraic problems related to both universal classes and specific
finite algebras, and also enables one to pose and investigate the
problem of the computation resources of universal
algebras.
@article{RM_2001_56_4_a1,
author = {A. G. Pinus},
title = {Conditional terms and their applications in algebra and computation theory},
journal = {Trudy Matematicheskogo Instituta imeni V.A. Steklova},
pages = {649--686},
publisher = {mathdoc},
volume = {56},
number = {4},
year = {2001},
language = {en},
url = {http://geodesic.mathdoc.fr/item/RM_2001_56_4_a1/}
}
TY - JOUR AU - A. G. Pinus TI - Conditional terms and their applications in algebra and computation theory JO - Trudy Matematicheskogo Instituta imeni V.A. Steklova PY - 2001 SP - 649 EP - 686 VL - 56 IS - 4 PB - mathdoc UR - http://geodesic.mathdoc.fr/item/RM_2001_56_4_a1/ LA - en ID - RM_2001_56_4_a1 ER -
A. G. Pinus. Conditional terms and their applications in algebra and computation theory. Trudy Matematicheskogo Instituta imeni V.A. Steklova, Tome 56 (2001) no. 4, pp. 649-686. http://geodesic.mathdoc.fr/item/RM_2001_56_4_a1/