Geodesic
On arithmetic complexity of certain constructive logics
Matematičeskie zametki, Tome 52 (1992) no. 1, pp. 94-104.

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

A constructive arithmetical theory is an arbitrary set of closed arithmetical formulas that is closed with respect to derivability in an intuitionsitic arithmetic with the Markov principle and the formal Church thesis. For each arithmetical theory $T$ there is a corresponding logic $L(T)$ consisting of closed predicate formulas in which all arithmetic instances belong to $T$. For so-called internally enumerable constructive arithmetical theories with the property of existentiality, it is proved that the logic $L(T)$ is $\Pi_1^T$-complete. This implies, for example, that the logic of traditional constructivism is $\Pi_2^0$-complete. 
@article{MZM_1992_52_1_a13,
     author = {V. E. Plisko},
     title = {On arithmetic complexity of certain constructive logics},
     journal = {Matemati\v{c}eskie zametki},
     pages = {94--104},
     publisher = {mathdoc},
     volume = {52},
     number = {1},
     year = {1992},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/MZM_1992_52_1_a13/}
}
TY  - JOUR
AU  - V. E. Plisko
TI  - On arithmetic complexity of certain constructive logics
JO  - Matematičeskie zametki
PY  - 1992
SP  - 94
EP  - 104
VL  - 52
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/MZM_1992_52_1_a13/
LA  - ru
ID  - MZM_1992_52_1_a13
ER  - 
%0 Journal Article
%A V. E. Plisko
%T On arithmetic complexity of certain constructive logics
%J Matematičeskie zametki
%D 1992
%P 94-104
%V 52
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/MZM_1992_52_1_a13/
%G ru
%F MZM_1992_52_1_a13
V. E. Plisko. On arithmetic complexity of certain constructive logics. Matematičeskie zametki, Tome 52 (1992) no. 1, pp. 94-104. http://geodesic.mathdoc.fr/item/MZM_1992_52_1_a13/