Voir la notice de l'article provenant de la source Math-Net.Ru
@article{FPM_1999_5_1_a12, author = {V. E. Plisko}, title = {On~arithmetic complexity of the~predicate logics of complete constructive arithmetic theories}, journal = {Fundamentalʹna\^a i prikladna\^a matematika}, pages = {221--255}, publisher = {mathdoc}, volume = {5}, number = {1}, year = {1999}, language = {ru}, url = {http://geodesic.mathdoc.fr/item/FPM_1999_5_1_a12/} }
TY - JOUR AU - V. E. Plisko TI - On~arithmetic complexity of the~predicate logics of complete constructive arithmetic theories JO - Fundamentalʹnaâ i prikladnaâ matematika PY - 1999 SP - 221 EP - 255 VL - 5 IS - 1 PB - mathdoc UR - http://geodesic.mathdoc.fr/item/FPM_1999_5_1_a12/ LA - ru ID - FPM_1999_5_1_a12 ER -
V. E. Plisko. On~arithmetic complexity of the~predicate logics of complete constructive arithmetic theories. Fundamentalʹnaâ i prikladnaâ matematika, Tome 5 (1999) no. 1, pp. 221-255. http://geodesic.mathdoc.fr/item/FPM_1999_5_1_a12/