Provability interpretation of non-normal modal logics having neighborhood semantics
Abstract
We study provability predicates PrT(x) satisfying the following condition E from a modal logical perspective: E: if T , then T PrT( ) PrT( ). For this purpose, we develop a new method of embedding models based on neighborhood semantics into arithmetic. Our method broadens the scope of arithmetical completeness proofs. In particular, we prove the arithmetical completeness theorems for the non-normal modal logics EN, ECN, ENP, END, and ECNP.
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.