21 citations to 10.1016/j.apal.2009.06.011 (Crossref Cited-By Service)
  1. L. D. Beklemishev, “A simplified proof of arithmetical completeness theorem for provability logic GLP”, Proc. Steklov Inst. Math., 274, no. 1, 2011, 25  crossref
  2. E. V. Dashkov, “On the positive fragment of the polymodal provability logic GLP”, Math Notes, 91, no. 3-4, 2012, 318  crossref
  3. Lev Beklemishev, David Gabelaia, “Topological completeness of the provability logic GLP”, Annals of Pure and Applied Logic, 164, no. 12, 2013, 1201  crossref
  4. Ilya Shapirovsky, “Satisfiability Problems on Sums of Kripke Frames”, ACM Trans. Comput. Logic, 23, no. 3, 2022, 1  crossref
  5. Lev Beklemishev, David Gabelaia, 4, Leo Esakia on Duality in Modal and Intuitionistic Logics, 2014, 257  crossref
  6. Gerald Berger, Lev D Beklemishev, Hans Tompits, “A many-sorted variant of Japaridze’s polymodal provability logic”, Logic Journal of the IGPL, 26, no. 5, 2018, 505  crossref
  7. Daniyar S. Shamkanov, “Interpolation properties for provability logics GL and GLP”, Proc. Steklov Inst. Math., 274, no. 1, 2011, 303  crossref
  8. L. D. Beklemishev, “On the reduction property for GLP-algebras”, Dokl. Math., 95, no. 1, 2017, 50  crossref
  9. F N Pakhomov, “Linear $ \mathrm{GLP}$-algebras and their elementary theories”, Izv. Math., 80, no. 6, 2016, 1159  crossref
  10. Lev Veniaminovich Dvorkin, “О логиках доказуемости арифметики Нибергалля”, Известия Российской академии наук. Серия математическая, 88, no. 3, 2024, 61  crossref
Previous
1
2
3
Next