2000 character limit reached
Finite axiomatization of $\textbf{GL}\times\textbf{S5}$ and $\textbf{Grz}\times\textbf{S5}$
Published 10 Dec 2025 in math.LO | (2512.09381v1)
Abstract: We prove that $\mathbf{GL} \times \mathbf{S5}$ is product matching, and that $\mathbf{Grz} \times \mathbf{S5}$ is axiomatizable by adding to $[\mathbf{Grz},\mathbf{S5}]$ the Gödel translation of the monadic Casari formula. This settles the question of finite axiomatization these logics.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.