Unification in subsystem J2 of provability logic GLB
Abstract
We generalize methods, developed by S. Ghilardi, and apply them to a subsystem J2 of bimodal provability logic GLB. We describe projective formulas in J2 in terms of Kripke semantics and prove that logic J2 has finitary unification type. As an application, we show that admissibility problem for J2 is decidable.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.