2000 character limit reached
Visser frames for sublogics of $\mathbf{IL}$
Published 29 Nov 2022 in math.LO | (2211.15919v2)
Abstract: We study the modal completeness and the finite frame property of several sublogics of the logic $\mathbf{IL}$ of interpretability with respect to Visser frames, which are also called simplified Veltman frames. Among other things, we prove that the logic $\mathbf{CL}$ of conservativity has the finite frame property with respect to that frames. This is an affirmative solution to Ignatiev's problem.
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.