Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
173 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Visser frames for sublogics of $\mathbf{IL}$ (2211.15919v2)

Published 29 Nov 2022 in math.LO

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.

Summary

We haven't generated a summary for this paper yet.