Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
144 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

Modal completeness of sublogics of the interpretability logic $\mathbf{IL}$ (2004.03813v3)

Published 8 Apr 2020 in math.LO

Abstract: We study modal completeness and incompleteness of several sublogics of the interpretability logic $\mathbf{IL}$. We introduce the sublogic $\mathbf{IL}-$, and prove that $\mathbf{IL}-$ is sound and complete with respect to Veltman prestructures which are introduced by Visser. Moreover, we prove the modal completeness of twelve logics between $\mathbf{IL}-$ and $\mathbf{IL}$ with respect to Veltman prestructures. On the other hand, we prove that eight natural sublogics of $\mathbf{IL}$ are modally incomplete. Finally, we prove that these incomplete logics are complete with respect to generalized Veltman prestructures. As a consequence of these investigations, we obtain that the twenty logics studied in this paper are all decidable.

Summary

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