Modal logics of conjunctively closed provability predicates
Abstract
We investigate non-normal modal logics corresponding to provability predicates PrT(x) satisfying the derivability condition C: TT( φ)T( ψ) PrT( φψ). The modal counterpart of this condition is the axiom scheme C: A B(A B). First, we introduce a new semantics based on closure operators for non-normal modal logics including logics adopting C as an axiom scheme. We prove modal completeness for several non-normal modal logics studied in this paper with respect to this semantics. Second, we prove the arithmetical completeness theorems for the logics CN, CNP, CNF, CNPF, and CND by using our new semantics.
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.