Geodesic
Finite alogorithmic procedures and inductive definability.
Mathematica Scandinavica, Tome 46 (1980), pp. 62-76.

Voir la notice de l'article provenant de la source European Digital Mathematics Library

Mots-clés : finite algorithmic procedures, computable functions over a relational structure, theory of computing in algebraic systems, constructiveness, register machines 
@article{MS2_1980__46_166690,
     author = {J. Moldestad and V. Stoltenberg-Hansen},
     title = {Finite alogorithmic procedures and inductive definability.},
     journal = {Mathematica Scandinavica},
     pages = {62--76},
     publisher = {mathdoc},
     volume = {46},
     year = {1980},
     zbl = {0448.03037},
     url = {http://geodesic.mathdoc.fr/item/MS2_1980__46_166690/}
}
TY  - JOUR
AU  - J. Moldestad
AU  - V. Stoltenberg-Hansen
TI  - Finite alogorithmic procedures and inductive definability.
JO  - Mathematica Scandinavica
PY  - 1980
SP  - 62
EP  - 76
VL  - 46
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/MS2_1980__46_166690/
ID  - MS2_1980__46_166690
ER  - 
%0 Journal Article
%A J. Moldestad
%A V. Stoltenberg-Hansen
%T Finite alogorithmic procedures and inductive definability.
%J Mathematica Scandinavica
%D 1980
%P 62-76
%V 46
%I mathdoc
%U http://geodesic.mathdoc.fr/item/MS2_1980__46_166690/
%F MS2_1980__46_166690
J. Moldestad; V. Stoltenberg-Hansen. Finite alogorithmic procedures and inductive definability.. Mathematica Scandinavica, Tome 46 (1980), pp. 62-76. http://geodesic.mathdoc.fr/item/MS2_1980__46_166690/