(1) Department of Computer Science, Tel-Aviv University Tel-Aviv, Israel;(2) Dipartimento di Matematica e, Informatica Università, di Udine Via delle Scienze 206, I-33100 Udine, Italy
Abstract:
We present and discuss various formalizations of Modal Logics in Logical Frameworks based on Type Theories. We consider both Hilbert- and Natural Deduction-style proof systems for representing both truth (local) and validity (global) consequence relations for various Modal Logics. We introduce several techniques for encoding the structural peculiarities of necessitation rules, in the typed -calculus metalanguage of the Logical Frameworks. These formalizations yield readily proof-editors for Modal Logics when implemented in Proof Development Environments, such as Coq or LEGO.