Geodesic
Undecidable classes of formulas for the constructive predicate calculus.~I
Informatics and Automation, Logical and logical-mathematical calculus. Part 2, Tome 121 (1972), pp. 100-108.

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

@article{TRSPY_1972_121_a5,
     author = {V. P. Orevkov},
     title = {Undecidable classes of formulas for the constructive predicate {calculus.~I}},
     journal = {Informatics and Automation},
     pages = {100--108},
     publisher = {mathdoc},
     volume = {121},
     year = {1972},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/TRSPY_1972_121_a5/}
}
TY  - JOUR
AU  - V. P. Orevkov
TI  - Undecidable classes of formulas for the constructive predicate calculus.~I
JO  - Informatics and Automation
PY  - 1972
SP  - 100
EP  - 108
VL  - 121
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/TRSPY_1972_121_a5/
LA  - ru
ID  - TRSPY_1972_121_a5
ER  - 
%0 Journal Article
%A V. P. Orevkov
%T Undecidable classes of formulas for the constructive predicate calculus.~I
%J Informatics and Automation
%D 1972
%P 100-108
%V 121
%I mathdoc
%U http://geodesic.mathdoc.fr/item/TRSPY_1972_121_a5/
%G ru
%F TRSPY_1972_121_a5
V. P. Orevkov. Undecidable classes of formulas for the constructive predicate calculus.~I. Informatics and Automation, Logical and logical-mathematical calculus. Part 2, Tome 121 (1972), pp. 100-108. http://geodesic.mathdoc.fr/item/TRSPY_1972_121_a5/