English

Modal logics of conjunctively closed provability predicates

Logic 2026-07-09 v1

Abstract

We investigate non-normal modal logics corresponding to provability predicates PrT(x)\mathrm{Pr}_T(x) satisfying the derivability condition C\mathbf{C}: TPrT(φ)PrT(ψ)PrT(φψ)T\vdash\mathrm{Pr}_T(\ulcorner \varphi \urcorner)\land\mathrm{Pr}_T(\ulcorner \psi \urcorner)\to \mathrm{Pr}_T(\ulcorner \varphi\land\psi \urcorner). The modal counterpart of this condition is the axiom scheme C\mathsf{C}: AB(AB)\Box A\land\Box B\to\Box(A\land B). First, we introduce a new semantics based on closure operators for non-normal modal logics including logics adopting C\mathsf{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\mathsf{CN}, CNP\mathsf{CNP}, CNF\mathsf{CNF}, CNPF\mathsf{CNPF}, and CND\mathsf{CND} by using our new semantics.

Cite

@article{arxiv.2607.08730,
  title  = {Modal logics of conjunctively closed provability predicates},
  author = {Haruka Kogure and Taishi Kurahashi},
  journal= {arXiv preprint arXiv:2607.08730},
  year   = {2026}
}

Comments

29 pages