On the positive fragment of the polymodal provability logic GLP |
| |
Authors: | E V Dashkov |
| |
Institution: | 1. Moscow State University, Moscow, Russia
|
| |
Abstract: | The fragment of the polymodal provability logic GLP in the language with connectives ┬, Λ, and 〈n〉 for all n ∈ ω is considered. For this fragment, a deductive system is constructed, a Kripke semantics is proposed, and a polynomial bound for the complexity of a decision procedure is obtained. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|