Geodesic
Absolute realizability of predicate formulas
Izvestiya. Mathematics , Tome 22 (1984) no. 2, pp. 291-308

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

The concept of an absolutely realizable predicate formula is introduced. It can be regarded as a certain refinement of the concept of a constructively generally valid formula in predicate logic. It is proved that the class of all absolutely realizable formulas is a $\Pi^1_1$-complete set. Bibliography: 16 titles. 
@article{IM2_1984_22_2_a5,
     author = {V. E. Plisko},
     title = {Absolute realizability of predicate formulas},
     journal = {Izvestiya. Mathematics },
     pages = {291--308},
     publisher = {mathdoc},
     volume = {22},
     number = {2},
     year = {1984},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/IM2_1984_22_2_a5/}
}
TY  - JOUR
AU  - V. E. Plisko
TI  - Absolute realizability of predicate formulas
JO  - Izvestiya. Mathematics 
PY  - 1984
SP  - 291
EP  - 308
VL  - 22
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/IM2_1984_22_2_a5/
LA  - en
ID  - IM2_1984_22_2_a5
ER  - 
%0 Journal Article
%A V. E. Plisko
%T Absolute realizability of predicate formulas
%J Izvestiya. Mathematics 
%D 1984
%P 291-308
%V 22
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/IM2_1984_22_2_a5/
%G en
%F IM2_1984_22_2_a5
V. E. Plisko. Absolute realizability of predicate formulas. Izvestiya. Mathematics , Tome 22 (1984) no. 2, pp. 291-308. http://geodesic.mathdoc.fr/item/IM2_1984_22_2_a5/