A survey of predicate realizability logic
Informatics and Automation, Algorithmic aspects of algebra and logic, Tome 274 (2011), pp. 222-251

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

The paper contains a survey of the results and methods of studying interpretations of predicate formulas based on constructive semantics of the first-order language of arithmetic and its extensions.
@article{TRSPY_2011_274_a12,
     author = {Valerii E. Plisko},
     title = {A survey of predicate realizability logic},
     journal = {Informatics and Automation},
     pages = {222--251},
     publisher = {mathdoc},
     volume = {274},
     year = {2011},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/TRSPY_2011_274_a12/}
}
TY  - JOUR
AU  - Valerii E. Plisko
TI  - A survey of predicate realizability logic
JO  - Informatics and Automation
PY  - 2011
SP  - 222
EP  - 251
VL  - 274
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/TRSPY_2011_274_a12/
LA  - ru
ID  - TRSPY_2011_274_a12
ER  - 
%0 Journal Article
%A Valerii E. Plisko
%T A survey of predicate realizability logic
%J Informatics and Automation
%D 2011
%P 222-251
%V 274
%I mathdoc
%U http://geodesic.mathdoc.fr/item/TRSPY_2011_274_a12/
%G ru
%F TRSPY_2011_274_a12
Valerii E. Plisko. A survey of predicate realizability logic. Informatics and Automation, Algorithmic aspects of algebra and logic, Tome 274 (2011), pp. 222-251. http://geodesic.mathdoc.fr/item/TRSPY_2011_274_a12/