Finite axiomatization of GL×S5 and Grz×S5
Abstract
We prove that GL × S5 is product matching, and that Grz × S5 is axiomatizable by adding to [Grz,S5] the G\"odel translation of the monadic Casari formula. This settles the question of the finite axiomatizability of these logics posed by Gabbay and Shehtman (1998).
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.