Geodesic
On the absence of finite approximation relative to model completeness in propositional provability logic
Buletinul Academiei de Ştiinţe a Republicii Moldova. Matematica, no. 3 (2015), pp. 110-113

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

In the present paper we consider the expressibility of formulas in the provability logic $GL$ and related to it questions of the model completeness of system of formulas. We prove the absence of a finite approximation relative to model completeness in $GL$. 
@article{BASM_2015_3_a8,
     author = {Olga Izbash and Andrei Rusu},
     title = {On the absence of finite approximation relative to model completeness in propositional provability logic},
     journal = {Buletinul Academiei de \c{S}tiin\c{t}e a Republicii Moldova. Matematica},
     pages = {110--113},
     publisher = {mathdoc},
     number = {3},
     year = {2015},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/BASM_2015_3_a8/}
}
TY  - JOUR
AU  - Olga Izbash
AU  - Andrei Rusu
TI  - On the absence of finite approximation relative to model completeness in propositional provability logic
JO  - Buletinul Academiei de Ştiinţe a Republicii Moldova. Matematica
PY  - 2015
SP  - 110
EP  - 113
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/BASM_2015_3_a8/
LA  - en
ID  - BASM_2015_3_a8
ER  - 
%0 Journal Article
%A Olga Izbash
%A Andrei Rusu
%T On the absence of finite approximation relative to model completeness in propositional provability logic
%J Buletinul Academiei de Ştiinţe a Republicii Moldova. Matematica
%D 2015
%P 110-113
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/BASM_2015_3_a8/
%G en
%F BASM_2015_3_a8
Olga Izbash; Andrei Rusu. On the absence of finite approximation relative to model completeness in propositional provability logic. Buletinul Academiei de Ştiinţe a Republicii Moldova. Matematica, no. 3 (2015), pp. 110-113. http://geodesic.mathdoc.fr/item/BASM_2015_3_a8/