Geodesic
Arithmetical realizability and primitive recursive realizability
Vestnik Moskovskogo universiteta. Matematika, mehanika, no. 4 (2016), pp. 60-64

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

The semantics of the predicate logic based on the absolute arithmetical realizability is proved to differ from the semantics based on the primitive recursive realizability by Salehi. 
@article{VMUMM_2016_4_a9,
     author = {A. Yu. Konovalov},
     title = {Arithmetical realizability and primitive recursive realizability},
     journal = {Vestnik Moskovskogo universiteta. Matematika, mehanika},
     pages = {60--64},
     publisher = {mathdoc},
     number = {4},
     year = {2016},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/VMUMM_2016_4_a9/}
}
TY  - JOUR
AU  - A. Yu. Konovalov
TI  - Arithmetical realizability and primitive recursive realizability
JO  - Vestnik Moskovskogo universiteta. Matematika, mehanika
PY  - 2016
SP  - 60
EP  - 64
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/VMUMM_2016_4_a9/
LA  - ru
ID  - VMUMM_2016_4_a9
ER  - 
%0 Journal Article
%A A. Yu. Konovalov
%T Arithmetical realizability and primitive recursive realizability
%J Vestnik Moskovskogo universiteta. Matematika, mehanika
%D 2016
%P 60-64
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/VMUMM_2016_4_a9/
%G ru
%F VMUMM_2016_4_a9
A. Yu. Konovalov. Arithmetical realizability and primitive recursive realizability. Vestnik Moskovskogo universiteta. Matematika, mehanika, no. 4 (2016), pp. 60-64. http://geodesic.mathdoc.fr/item/VMUMM_2016_4_a9/