Geodesic
Infinitely many functional pre-complete classes of formulas in the propositional provability intuitionistic logic
Buletinul Academiei de Ştiinţe a Republicii Moldova. Matematica, no. 1 (2007), pp. 66-72

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

We consider the propositional provability intuitionistic logic $I^\Delta$, introduced by A. V. Kuznetsov [2]. We prove that there are infinitely many classes of formulas in the calculus of $I^\Delta$, which are pre-complete with respect to functional expressibility in $I^\Delta$. This result is stronger than an ealier one stated by the author in [1]. 
@article{BASM_2007_1_a5,
     author = {A. Rusu},
     title = {Infinitely many functional pre-complete classes of formulas in the propositional provability intuitionistic logic},
     journal = {Buletinul Academiei de \c{S}tiin\c{t}e a Republicii Moldova. Matematica},
     pages = {66--72},
     publisher = {mathdoc},
     number = {1},
     year = {2007},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/BASM_2007_1_a5/}
}
TY  - JOUR
AU  - A. Rusu
TI  - Infinitely many functional pre-complete classes of formulas in the propositional provability intuitionistic logic
JO  - Buletinul Academiei de Ştiinţe a Republicii Moldova. Matematica
PY  - 2007
SP  - 66
EP  - 72
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/BASM_2007_1_a5/
LA  - en
ID  - BASM_2007_1_a5
ER  - 
%0 Journal Article
%A A. Rusu
%T Infinitely many functional pre-complete classes of formulas in the propositional provability intuitionistic logic
%J Buletinul Academiei de Ştiinţe a Republicii Moldova. Matematica
%D 2007
%P 66-72
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/BASM_2007_1_a5/
%G en
%F BASM_2007_1_a5
A. Rusu. Infinitely many functional pre-complete classes of formulas in the propositional provability intuitionistic logic. Buletinul Academiei de Ştiinţe a Republicii Moldova. Matematica, no. 1 (2007), pp. 66-72. http://geodesic.mathdoc.fr/item/BASM_2007_1_a5/