On the Positive Fragment of the Polymodal Provability Logic $\mathbf{GLP}$
Matematičeskie zametki, Tome 91 (2012) no. 3, pp. 331-346

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

The fragment of the polymodal provability logic $\mathbf{GLP}$ in the language with connectives $\top$, $\wedge$, and $\langle n\rangle$ for all $n\in\omega$ is considered. For this fragment, a deductive system it constructed, a Kripke semantics is proposed, and a polynomial bound for the complexity of a decision procedure is obtained.
Keywords: modal logic, graded provability logic $\mathbf{GLP}$, deductive system, Kripke semantics, complexity of a decision procedure.
Mots-clés : equational calculus
@article{MZM_2012_91_3_a1,
     author = {E. V. Dashkov},
     title = {On the {Positive} {Fragment} of the {Polymodal} {Provability} {Logic} $\mathbf{GLP}$},
     journal = {Matemati\v{c}eskie zametki},
     pages = {331--346},
     publisher = {mathdoc},
     volume = {91},
     number = {3},
     year = {2012},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/MZM_2012_91_3_a1/}
}
TY  - JOUR
AU  - E. V. Dashkov
TI  - On the Positive Fragment of the Polymodal Provability Logic $\mathbf{GLP}$
JO  - Matematičeskie zametki
PY  - 2012
SP  - 331
EP  - 346
VL  - 91
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/MZM_2012_91_3_a1/
LA  - ru
ID  - MZM_2012_91_3_a1
ER  - 
%0 Journal Article
%A E. V. Dashkov
%T On the Positive Fragment of the Polymodal Provability Logic $\mathbf{GLP}$
%J Matematičeskie zametki
%D 2012
%P 331-346
%V 91
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/MZM_2012_91_3_a1/
%G ru
%F MZM_2012_91_3_a1
E. V. Dashkov. On the Positive Fragment of the Polymodal Provability Logic $\mathbf{GLP}$. Matematičeskie zametki, Tome 91 (2012) no. 3, pp. 331-346. http://geodesic.mathdoc.fr/item/MZM_2012_91_3_a1/