{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T15:51:12Z","timestamp":1774626672625,"version":"3.50.1"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"7-8","license":[{"start":{"date-parts":[[2014,9,3]],"date-time":"2014-09-03T00:00:00Z","timestamp":1409702400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Arch. Math. Logic"],"published-print":{"date-parts":[[2014,11]]},"DOI":"10.1007\/s00153-014-0397-4","type":"journal-article","created":{"date-parts":[[2014,9,2]],"date-time":"2014-09-02T09:22:33Z","timestamp":1409649753000},"page":"949-967","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["On the complexity of the closed fragment of Japaridze\u2019s provability logic"],"prefix":"10.1007","volume":"53","author":[{"given":"Fedor","family":"Pakhomov","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,9,3]]},"reference":[{"key":"397_CR1","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1070\/RM2005v060n02ABEH000823","volume":"60","author":"L.D. Beklemishev","year":"2005","unstructured":"Beklemishev L.D.: Reflection principles and provability algebras in formal arithmetic. Russ. Math. Surv. 60, 197\u2013268 (2005)","journal-title":"Russ. Math. Surv."},{"key":"397_CR2","unstructured":"Beklemishev, L.D.: Veblen hierarchy in the context of provability algebras. In: Logic, Methodology and Philosophy of Science, Proceedings of the Twelfth International Congress, pp. 65\u201378. Kings College Publications (2005)"},{"issue":"3","key":"397_CR3","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1007\/s11225-013-9490-7","volume":"102","author":"L.D. Beklemishev","year":"2014","unstructured":"Beklemishev L.D., Fern\u00e1ndez-Duque D., Joosten J.J.: On provability logics with linearly ordered modalities. Studia Logica 102(3), 541\u2013566 (2014)","journal-title":"Studia Logica"},{"issue":"4","key":"397_CR4","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1093\/logcom\/exi038","volume":"15","author":"L.D. Beklemishev","year":"2005","unstructured":"Beklemishev L.D., Joosten J.J., Vervoort M.: A finitary treatment of the closed fragment of Japaridze\u2019s provability logic. J. Logic Comput. 15(4), 447\u2013463 (2005)","journal-title":"J. Logic Comput."},{"key":"397_CR5","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/j.entcs.2011.10.005","volume":"278","author":"F. Bou","year":"2011","unstructured":"Bou F., Joosten J.J.: The closed fragment of il is pspace hard. Electron. Notes Theor. Comput. Sci. 278, 47\u201354 (2011)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"397_CR6","unstructured":"Chagrov, A.V., Rybakov, M.N.: How many variables does one need to prove PSPACE-hardness of modal logics. In: Advances in Modal Logic, pp. 71\u201382 (2002)"},{"issue":"4","key":"397_CR7","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1016\/S0022-0000(73)80029-7","volume":"7","author":"S.A. Cook","year":"1973","unstructured":"Cook S.A., Reckhow R.A.: Time bounded random access machines. J. Comput. Syst. Sci. 7(4), 354\u2013375 (1973)","journal-title":"J. Comput. Syst. Sci."},{"key":"397_CR8","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1134\/S0001434612030029","volume":"91","author":"E. Dashkov","year":"2012","unstructured":"Dashkov E.: On the positive fragment of the polymodal provability logic GLP. Math. Notes 91, 318\u2013333 (2012)","journal-title":"Math. Notes"},{"issue":"1","key":"397_CR9","doi-asserted-by":"crossref","first-page":"249","DOI":"10.2307\/2275337","volume":"58","author":"K.N. Ignatiev","year":"1993","unstructured":"Ignatiev K.N.: On strong provability predicates and the associated modal logics. J. Symb. Log. 58(1), 249\u2013290 (1993)","journal-title":"J. Symb. Log."},{"key":"397_CR10","unstructured":"Japaridze, G.K.: The modal logical means of investigation of provability. Thesis in Philosophy, Moscow (in Russian) (1986)"},{"key":"397_CR11","unstructured":"Joosten, J.J.: Interpretability formalized. Ph.D thesis, Utrecht University (2004)"},{"issue":"3","key":"397_CR12","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1137\/0206033","volume":"6","author":"R.E. Ladner","year":"1977","unstructured":"Ladner R.E.: The computational complexity of provability in systems of modal propositional logic. SIAM J. Comput. 6(3), 467\u2013480 (1977)","journal-title":"SIAM J. Comput."},{"key":"397_CR13","unstructured":"Shapirovsky, I.: PSPACE-decidability of Japaridze\u2019s polymodal logic. In :Advances in Modal Logic, pp. 289\u2013304 (2008)"},{"key":"397_CR14","doi-asserted-by":"crossref","unstructured":"Stockmeyer, L.J., Meyer, A.R.: Word problems requiring exponential time (preliminary report). In: Proceedings of the Fifth Annual ACM Symposium on Theory of Computing, STOC \u201973, pp. 1\u20139, New York, NY, USA, ACM (1973)","DOI":"10.1145\/800125.804029"},{"issue":"8","key":"397_CR15","doi-asserted-by":"crossref","first-page":"763","DOI":"10.1007\/s00153-003-0180-4","volume":"42","author":"V. \u0160vejdar","year":"2003","unstructured":"\u0160vejdar V.: The decision problem of provability logic with only one atom. Arch. Math. Logic 42(8), 763\u2013768 (2003)","journal-title":"Arch. Math. Logic"}],"container-title":["Archive for Mathematical Logic"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00153-014-0397-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00153-014-0397-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00153-014-0397-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,14]],"date-time":"2019-08-14T11:37:53Z","timestamp":1565782673000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00153-014-0397-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,9,3]]},"references-count":15,"journal-issue":{"issue":"7-8","published-print":{"date-parts":[[2014,11]]}},"alternative-id":["397"],"URL":"https:\/\/doi.org\/10.1007\/s00153-014-0397-4","relation":{},"ISSN":["0933-5846","1432-0665"],"issn-type":[{"value":"0933-5846","type":"print"},{"value":"1432-0665","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,9,3]]}}}