Geodesic
The nonarithmeticity of the class of realizable predicate formulas
Izvestiya. Mathematics , Tome 11 (1977) no. 3, pp. 453-471.

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

It is proved that the set of Gödel numbers of realizable predicate formulas is not definable in the language of formal arithmetic. Bibliography: 13 titles. 
@article{IM2_1977_11_3_a0,
     author = {V. E. Plisko},
     title = {The nonarithmeticity of the class of realizable predicate formulas},
     journal = {Izvestiya. Mathematics },
     pages = {453--471},
     publisher = {mathdoc},
     volume = {11},
     number = {3},
     year = {1977},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/IM2_1977_11_3_a0/}
}
TY  - JOUR
AU  - V. E. Plisko
TI  - The nonarithmeticity of the class of realizable predicate formulas
JO  - Izvestiya. Mathematics 
PY  - 1977
SP  - 453
EP  - 471
VL  - 11
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/IM2_1977_11_3_a0/
LA  - en
ID  - IM2_1977_11_3_a0
ER  - 
%0 Journal Article
%A V. E. Plisko
%T The nonarithmeticity of the class of realizable predicate formulas
%J Izvestiya. Mathematics 
%D 1977
%P 453-471
%V 11
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/IM2_1977_11_3_a0/
%G en
%F IM2_1977_11_3_a0
V. E. Plisko. The nonarithmeticity of the class of realizable predicate formulas. Izvestiya. Mathematics , Tome 11 (1977) no. 3, pp. 453-471. http://geodesic.mathdoc.fr/item/IM2_1977_11_3_a0/

[1] Kleene S. C., “On the interpretation of intuitionistic number theory”, J. Symb. Logic, 10 (1945), 109–124 | DOI | MR | Zbl

[2] Nelson D., “Recursive functions and intuitionistic number theory”, Trans. Amer. Math. Soc., 61 (1947), 307–368 | DOI | MR

[3] Rose G. F., “Propositional calculus and readability”, Trans. Amer. Math. Soc., 75 (1953), 1–19 | DOI | MR | Zbl

[4] Orevkov V. P., “Svyaz konstruktivnoi obscheznachimosti s vyvodimostyu v klassicheskom ischislenii predikatov”, Vsesoyuznyi simpozium po matem. logike, tezisy dokladov, Alma-Ata, 1969, 35

[5] Plisko V. E., “O realizuemykh predikatnykh formulakh”, Dokl. AN SSSR, 212:3 (1973), 553–556 | MR | Zbl

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

[7] Kipnis M. M., “O realizatsiyakh predikatnykh formul”, Zapiski nauchnykh seminarov Leningr. otd. Matem. in-ta AN SSSR, 20, 1971, 40–48 | MR | Zbl

[8] Yankov V. A., “O realizuemykh formulakh logiki vyskazyvanii”, Dokl. AN SSSR, 151:5 (1963), 1035–1037 | Zbl

[9] Tseitin G. S., “O diz'yunktivnom range formul konstruktivnoi arifmetiki”, Zapiski nauchnykh seminarov Leningr. otd. Matem. in-ta AN SSSR, 8, 1968, 260–271

[10] Plisko V. E., “Ob odnoi formalnoi sisteme, svyazannoi s realizuemostyu”, Teoriya algorifmov i matematicheskaya logik, VTs AN SSSR, M., 1974, 148–158 | MR

[11] Kleene S. C., “Logical calculus and readability”, Acta Philos. Fenn., 18 (1965), 71–80 | MR | Zbl

[12] Zaslavskii I. D., “O nekotorykh razlichiyakh mezhdu bazisnymi i podchinennymi peremennymi v logiko-matematicheskikh yazykakh”, Matem. voprosy kibernetiki i vychisl. tekhn., AN Arm. SSR, Erevan, 1963, 13–29 | Zbl

[13] Tarski A., “Der Wahrheitsbegriff in den formalisierten Sprachen”, Stud. Philos., 1 (1935), 261–405 | Zbl