Results 1 
1 of
1
A Computational Interpretation of Modal Proofs
 Proof Theory of Modal Logics
, 1994
"... The usual (e.g. Prawitz's) treatment of natural deduction for modal logics involves a complicated rule for the introduction of the necessity, since the naive one does not allow normalization. We propose natural deduction systems for the positive fragments of the modal logics K, K4, KT, and S4, exten ..."
Abstract

Cited by 28 (2 self)
 Add to MetaCart
The usual (e.g. Prawitz's) treatment of natural deduction for modal logics involves a complicated rule for the introduction of the necessity, since the naive one does not allow normalization. We propose natural deduction systems for the positive fragments of the modal logics K, K4, KT, and S4, extending previous work by Masini on a twodimensional generalization of Gentzen's sequents (2sequents). The modal rules closely match the standard rules for an universal quantifier and different logics are obtained with simple conditions on the elimination rule for 2. We give an explicit term calculus corresponding to proofs in these systems and, after defining a notion of reduction on terms, we prove its confluence and strong normalization. 1. Introduction Proof theory of modal logics, though largely studied since the fifties, has always been a delicate subject, the main reason being the apparent impossibility to obtain elegant, natural systems for intensional operators (with the excellent ex...