PTCS '01 Proceedings of the International Seminar on Proof Theory in Computer Science
A judgmental reconstruction of modal logic
Mathematical Structures in Computer Science
A computational approach to reflective meta-reasoning about languages with bindings
Proceedings of the 3rd ACM SIGPLAN workshop on Mechanized reasoning about languages with variable binding
Type-safe higher-order channels in ML-like languages
ICFP '07 Proceedings of the 12th ACM SIGPLAN international conference on Functional programming
| Hi-index | 0.00 |
In the proof-theoretic study of logic, the notion of normal proof has been understood and investigated as a metalogical property. Usually we formulate a system of logic, identify a class of proofs as normal proofs, and show that every proof in the system reduces to a corresponding normal proof. This paper develops a system of modal logic that is capable of expressing the notion of normal proof within the system itself, thereby making normal proofs an inherent property of the logic. Using a modality @? to express the existence of a normal proof, the system provides a means for both recognizing and manipulating its own normal proofs. We develop the system as a sequent calculus with the implication connective @? and the modality @?, and prove the cut elimination theorem. From the sequent calculus, we derive two equivalent natural deduction systems.