Geodesic
Arithmetical realizability and basic logic
Vestnik Moskovskogo universiteta. Matematika, mehanika, no. 1 (2016), pp. 52-56 
A. Yu. Konovalov. Arithmetical realizability and basic logic. Vestnik Moskovskogo universiteta. Matematika, mehanika, no. 1 (2016), pp. 52-56. http://geodesic.mathdoc.fr/item/VMUMM_2016_1_a8/
@article{VMUMM_2016_1_a8,
     author = {A. Yu. Konovalov},
     title = {Arithmetical realizability and basic logic},
     journal = {Vestnik Moskovskogo universiteta. Matematika, mehanika},
     pages = {52--56},
     year = {2016},
     number = {1},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/VMUMM_2016_1_a8/}
}
TY  - JOUR
AU  - A. Yu. Konovalov
TI  - Arithmetical realizability and basic logic
JO  - Vestnik Moskovskogo universiteta. Matematika, mehanika
PY  - 2016
SP  - 52
EP  - 56
IS  - 1
UR  - http://geodesic.mathdoc.fr/item/VMUMM_2016_1_a8/
LA  - ru
ID  - VMUMM_2016_1_a8
ER  - 
%0 Journal Article
%A A. Yu. Konovalov
%T Arithmetical realizability and basic logic
%J Vestnik Moskovskogo universiteta. Matematika, mehanika
%D 2016
%P 52-56
%N 1
%U http://geodesic.mathdoc.fr/item/VMUMM_2016_1_a8/
%G ru
%F VMUMM_2016_1_a8

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

Absolute arithmetical realizability of predicate formulas is introduced. It is proved that the intuitionistic logic is not sound with this semantics, but the basic logic is sound.

[1] Klini S.K., Vvedenie v metamatematiku, IL, M., 1957

[2] Plisko V.E., “Absolyutnaya realizuemost predikatnykh formul”, Izv. AN SSSP. Ser. matem., 47:2 (1983), 315–334 | MR

[3] Ruitenburg W., “Basic predicate calculus”, Notre Dame J. Formal Logic, 39:1 (1998), 18–46 | DOI | MR | Zbl

[4] Salehi S., “Primitive recursive realizability and basic arithmetic”, Bull. Symbol. Logic, 7:1 (2001), 147—148