Geodesic
Destinies and decidability
Zapiski Nauchnykh Seminarov POMI, Computational complexity theory. Part VIII, Tome 304 (2003), pp. 121-127

Voir la notice de l'article provenant de la source Math-Net.Ru

Francis Nézondet has introduced a new tool in Logic, called destiny, used to study open problems in Number Theory. We give a sufficient condition of computation of destinies of a structure. 
@article{ZNSL_2003_304_a6,
     author = {P. C\'egielski},
     title = {Destinies and decidability},
     journal = {Zapiski Nauchnykh Seminarov POMI},
     pages = {121--127},
     publisher = {mathdoc},
     volume = {304},
     year = {2003},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/ZNSL_2003_304_a6/}
}
TY  - JOUR
AU  - P. Cégielski
TI  - Destinies and decidability
JO  - Zapiski Nauchnykh Seminarov POMI
PY  - 2003
SP  - 121
EP  - 127
VL  - 304
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/ZNSL_2003_304_a6/
LA  - en
ID  - ZNSL_2003_304_a6
ER  - 
%0 Journal Article
%A P. Cégielski
%T Destinies and decidability
%J Zapiski Nauchnykh Seminarov POMI
%D 2003
%P 121-127
%V 304
%I mathdoc
%U http://geodesic.mathdoc.fr/item/ZNSL_2003_304_a6/
%G en
%F ZNSL_2003_304_a6
P. Cégielski. Destinies and decidability. Zapiski Nauchnykh Seminarov POMI, Computational complexity theory. Part VIII, Tome 304 (2003), pp. 121-127. http://geodesic.mathdoc.fr/item/ZNSL_2003_304_a6/