Fedor Pakhomov
Published 2014-12-15Version 1
There is a polymodal provability logic $GLP$. We consider generalizations of this logic: the logics $GLP_{\alpha}$, where $\alpha$ ranges over linear ordered sets and play the role of the set of indexes of modalities. We consider the varieties of modal algebras that corresponds to the polymodal logics. We prove that the elementary theories of the free $\emptyset$-generated $GLP_{n}$ -algebras are decidable for all finite ordinals $n$.
On Generalized I-Algebras and 4-valued Modal Algebras
Hereditary undecidability of fragments of some elementary theories
Turing jumps through provability
![QR code for arXiv:1412.4439 [math.LO]](http://oss.arxitics.com/images/favicon.svg)