A simplified proof of arithmetical completeness theorem for provability logic GLP (Q2510758): Difference between revisions

@@ Property / author @@
-Lev D. Beklemishev
@@ Property / author: Lev D. Beklemishev / rank @@
-Normal rank
@@ Property / author @@
+Lev D. Beklemishev
@@ Property / author: Lev D. Beklemishev / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Reflection principles and provability algebras in formal arithmetic
+Normal rank
@@ Property / cites work @@
+Kripke semantics for provability logic GLP
@@ Property / cites work: Kripke semantics for provability logic GLP / rank @@
+Normal rank
@@ Property / cites work @@
+Q4397069
@@ Property / cites work: Q4397069 / rank @@
+Normal rank
@@ Property / cites work @@
+On strong provability predicates and the associated modal logics
+Normal rank
@@ Property / cites work @@
+Provability interpretations of modal logic
@@ Property / cites work: Provability interpretations of modal logic / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1134/s0081543811060046
+Normal rank
@@ Property / OpenAlex ID @@
+W1574162351
@@ Property / OpenAlex ID: W1574162351 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2510758