2000 character limit reached
On Elementary Theories of GLP-Algebras
Published 15 Dec 2014 in math.LO | (1412.4439v1)
Abstract: 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$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.