A many-sorted variant of Japaridze's polymodal provability logic

From MaRDI portal
Publication:5095650

DOI10.1093/JIGPAL/JZY012zbMATH Open1492.03020arXiv1601.02857OpenAlexW3098913837WikidataQ130042366 ScholiaQ130042366MaRDI QIDQ5095650FDOQ5095650


Authors: Gerald Berger, Hans Tompits, Lev D. Beklemishev Edit this on Wikidata


Publication date: 10 August 2022

Published in: Logic Journal of the IGPL (Search for Journal in Brave)

Abstract: We consider a many-sorted variant of Japaridze's polymodal provability logic mathsfGLP. In this variant, which is denoted mathsfGLPast, propositional variables are assigned sorts alphaleqomega, where variables of finite sort n<omega are interpreted as Pin+1-sentences of the arithmetical hierarchy, while those of sort omega range over arbitrary ones. We prove that mathsfGLPast is arithmetically complete with respect to this interpretation. Moreover, we relate mathsfGLPast to its one-sorted counterpart mathsfGLP and prove that the former inherits some well-known properties of the latter, like Craig interpolation and PSpace decidability. We also study a positive variant of mathsfGLPast which allows for an even richer arithmetical interpretation---variables are permitted to range over theories rather than single sentences. This interpretation in turn allows the introduction of a modality that corresponds to the full uniform reflection principle. We show that our positive variant of mathsfGLPast is arithmetically complete.


Full work available at URL: https://arxiv.org/abs/1601.02857




Recommendations





Cited In (2)





This page was built for publication: A many-sorted variant of Japaridze's polymodal provability logic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5095650)