Arrow Research search
Back to FLAP

FLAP 2021

Glivenko's Theorem, Finite Height, and Local Tabularity.

Journal Article Number 8 Logic in Computer Science

Abstract

Glivenko’s theorem states that a formula is derivable in classical propositional logic CL iff under the double negation it is derivable in intuitionistic propositional logic IL: CL ` ϕ iff IL ` ¬¬ϕ. Its analog for the modal logics S5 and S4 states that S5 ` ϕ iff S4 ` ¬2¬2ϕ. In Kripke semantics, IL is the logic of partial orders, and CL is the logic of partial orders of height 1. Likewise, S4 is the logic of preorders, and S5 is the logic of equivalence relations, which are preorders of height 1. In this paper we generalize Glivenko’s translation for logics of arbitrary finite height.

Authors

Keywords

  • Glivenko’s translation
  • modal logic
  • intermediate logic
  • finite height

Context

Venue
IfCoLog Journal of Logics and their Applications
Archive span
2014-2026
Indexed papers
633
Paper id
801202350693892981
v2026.09.13