On the complexity of the closed fragment of Japaridze’s provability logic-Reference-Cited by-同舟云学术

On the complexity of the closed fragment of Japaridze’s provability logic

Published:2014-09-03 Issue:7-8 Volume:53 Page:949-967
ISSN:0933-5846
Container-title:Archive for Mathematical Logic
language:en
Short-container-title:Arch. Math. Logic

Author:

Pakhomov Fedor

Publisher

Springer Science and Business Media LLC

Subject

Logic,Philosophy

Link

http://link.springer.com/content/pdf/10.1007/s00153-014-0397-4.pdf

Reference15 articles.

1. Beklemishev L.D.: Reflection principles and provability algebras in formal arithmetic. Russ. Math. Surv. 60, 197–268 (2005)

2. 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–78. Kings College Publications (2005)

3. Beklemishev L.D., Fernández-Duque D., Joosten J.J.: On provability logics with linearly ordered modalities. Studia Logica 102(3), 541–566 (2014)

4. Beklemishev L.D., Joosten J.J., Vervoort M.: A finitary treatment of the closed fragment of Japaridze’s provability logic. J. Logic Comput. 15(4), 447–463 (2005)

5. Bou F., Joosten J.J.: The closed fragment of il is pspace hard. Electron. Notes Theor. Comput. Sci. 278, 47–54 (2011)

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Modal Companions of $$K4^{+}$$;Studia Logica;2022-06-01

2. Satisfiability Problems on Sums of Kripke Frames;ACM Transactions on Computational Logic;2022-04-22

3. Complexity of the interpretability logics ILW and ILP;Logic Journal of the IGPL;2022-04-07

4. Reflection calculus and conservativity spectra;Russian Mathematical Surveys;2018-08

5. Complexity of the interpretability logic IL;Logic Journal of the IGPL;2018-06-13